Abstract
A permutation group H acting on a set X is said to be graphical if there is a graph G such that Γ(G), the automorphism group of G, is identical to H. Characterisation of graphical permutation groups seems to be difficult. Kagno and Chao have shown that the group generated by a single m-cycle is not graphical. Here we study the group generated by a permutation such that it consists of disjoint cycles whose lengths are multiples of the length of one of its cycles. Our results are obtained by constructing certain graphs which we call generalised permutation graphs. We also study graphical cycle permutation groups of order pm where p is a prime.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.N. Kagno, Linear graphs of degree ≤6 and their groups, Amer. Jour. Math., 68(1946), 505–520.
C.Y. Chao, On a theorem of Sabidussi, Proc. Amer. Math. Soc., 15(1964), 291–292.
S.P. Mohanty, M.R. Sridharan and S.K. Shukla, On cyclic permutation groups and graphs, Jour. Math. Phys. Sci., 12(1978) 409–416.
F. Harary, Graph Theory, Addison-Wesley, Reading, Mass, 1969.
H. Wielandt, Finite Permutation Groups, Academic Press Inc., New York, 1964.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Mohanty, S.P., Sridharan, M.R., Shukla, S.K. (1981). Graphical cyclic permutation groups. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092279
Download citation
DOI: https://doi.org/10.1007/BFb0092279
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11151-1
Online ISBN: 978-3-540-47037-3
eBook Packages: Springer Book Archive