Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-12T08:28:47.777Z Has data issue: false hasContentIssue false

A Construction for Vertex-Transitive Graphs

Published online by Cambridge University Press:  20 November 2018

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 α.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1982