On Cayley line digraphs
β Scribed by J.M. Brunat; M. Espona; M.A. Fiol; O. Serra
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 657 KB
- Volume
- 138
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Given a colouring A of a d-regular digraph G and a colouring H of the symmetric complete digraph on d vertices with loops, the uniformly induced colouring LnA of the line digraph LG is defined. It is shown that the group of colour-preserving automorphisms of (LG, L,A) is a subgroup of the group of colour-permuting automorphisms of (G,A). This result is then applied to prove that if (G,A) is a d-regular coloured digraph and (LG, LIIA) is a Cayley digraph, then (G, A ) is itself a Cayley digraph Cay (Q, A ) and H is a group of automorphisms of f2. In particular, a characterization of those Kautz digraphs which are Cayley digraphs is given.
If d= 2+ for every arc-transitive digraph G, LG is a Cayley digraph when the number k of orbits by the action of the so-called Rankin group is at most 5. If k>/3 the arc-transitive k-generalized cycles for which LG is a Cayley digraph are characterized.
π SIMILAR VOLUMES
A necessary and sufficient condition is given for two Cayley digraphs X 1 = Cay(G 1 , S 1 ) and X 2 = Cay(G 2 , S 2 ) to be isomorphic, where the groups G i are nonisomorphic abelian 2-groups, and the digraphs X i have a regular cyclic group of automorphisms. Our result extends that of Morris [J Gra
The complete generalized cycle G (d, n) is the digraph which has Z n Γ Z d as the vertex set and every vertex (i, x) is adjacent to the d vertices (i + 1, y) with y β Z d . As a main result, we give a necessary and sufficient condition for the iterated line digraph G(d, n, k) = L k-1 G(d, n), with d
Let Cay(S : H) be the Cayley digraph of the generators S in the group H. A one-way infinite Hamiltonian path in the digraph G is a listing of all the vertices [q: 1 ~< i <oo], such that there is an arc from vi to vi+ 1. A two-way infinite Hamiltonian path is similarly defined, with i ranging from -0