Arrangement graph

In graph theory, the arrangement graph is a graph defined on the vertex set consisting of all permutations of distinct elements chosen from , where two vertices are connected by an edge whenever their corresponding permutations differ in exactly one of their positions.[1][2]

Properties

The -arrangement graph has vertices, is regular with vertex degree , and is -connected. It has graph diameter and average distance , where is the th harmonic number. The arrangement graph is both vertex-transitive and edge-transitive.[1][2]

The -arrangement graph can be decomposed into subgraphs isomorphic to by fixing each different element in one particular position.[2]

The eigenvalues of the adjacency matrix of an arrangement graph are integers. For fixed and sufficiently large , is the only negative eigenvalue in the spectrum.[3]

Special cases

Setting yields the complete graph , setting yields the star graph, and setting yields the alternating group graph.[2][4] The arrangement graph is the line graph of the -crown graph.

Applications

Arrangement graphs were proposed as a generalization of star graphs to provide a more flexible choice of network parameters when designing an interconnection network for multiprocessor or multicomputer systems.[2] They preserve many attractive properties of star graphs, including vertex and edge transitivity, while allowing tuning of both parameters and for suitable network size.[1]

References

  1. ^ a b c Day, Khaled; Tripathi, Anand (1992). "Arrangement graphs: A class of generalized star graphs". Information Processing Letters. 42 (5): 235–241. doi:10.1016/0020-0190(92)90030-Y. ISSN 0020-0190.
  2. ^ a b c d e Lin, Chin-Tsai (2003). "Embedding k(n−k) edge-disjoint spanning trees in arrangement graphs". Journal of Parallel and Distributed Computing. 63 (12): 1277–1287. doi:10.1016/S0743-7315(03)00107-2. ISSN 0743-7315.
  3. ^ Araujo, José O.; Bratten, Tim (2017). "The spectra of arrangement graphs". Linear Algebra and Its Applications. 530: 461–469. arXiv:1612.04747. doi:10.1016/j.laa.2017.05.032. ISSN 0024-3795.
  4. ^ Wang, Shiying; Feng, Kai (2014). "Fault tolerance in the arrangement graphs". Theoretical Computer Science. 533: 64–71. doi:10.1016/j.tcs.2014.03.025. ISSN 0304-3975.