Hostname: page-component-5c6d5d7d68-lvtdw Total loading time: 0 Render date: 2024-08-23T22:54:06.623Z Has data issue: false hasContentIssue false
  • English
  • Français

A Construction for Vertex-Transitive Graphs

Published online by Cambridge University Press:  20 November 2018

Brian Alspach  and
T. D. Parsons
Brian Alspach
Affiliation:
Simon Fraser University, Burnaby, British Columbia
T. D. Parsons
Affiliation:
Pennsylvania State University, University Park, Pennsylvania
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A useful general strategy for the construction of interesting families of vertex-transitive graphs is to begin with some family of transitive permutation groups and to construct for each group Γ in the family all graphs G whose vertex–set is the orbit V of Γ and for which Γ ≦ Aut (G), where Aut (G) denotes the automorphism group of G. For example, if we consider the family of cyclic groups 〈(0 1 … n – 1)〉 generated by cycles (0, 1 … n – 1) of length n, then the corresponding graphs are the n-vertex circulant graphs.

In this paper we consider transitive permutation groups of degree mn generated by a “rotation” ρ which is a product of m disjoint cycles of length n and by a “twisted translation” t; such that τρτ–l = ρα for some α.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 34 , Issue 2 , 01 April 1982 , pp. 307 - 318
Copyright
Copyright © Canadian Mathematical Society 1982

References

1. Alspach, B. and Sutcliffe, J., Vertex-transitive graphs of order 2p, Annals N.Y. Acad. Sci. 319 (1979), 19–27.Google Scholar
2. Godsil, C., More odd graph theory, Discrete Math. 32 (1980), 205–207.Google Scholar
3. Marusic, D., On vertex-symmetric digraphs, Discrete Math. 36 (1981), 69–82.Google Scholar
4. Sabidussi, G., On a class of fixed-point-free graphs, Proc. Amer. Math. Soc. 9 (1958), 800–804.Google Scholar
5. Sabidussi, G., Vertex-transitive graphs, Monatsh. Math. 68 (1964), 426–438.Google Scholar