Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
R.A. Beaumont and R.P. Peterson, Set-transitive permutation groups, Canad. J. Math, 7 (1955), 34–42.
I.Z. Bouwer, Section graphs for finite permutation groups, J. Combinatorial Theory, to appear.
C.-Y. Chao, On a theorem of Sabidussi, Proc. Amer. Math. Soc., 15 (1964), 291–292. (see also [6][13])
C.-Y. Chao, On groups and graphs, Trans. Amer. Math. Soc., 118 (1965), 488–497.
R. Frucht, Herstellung von Graphen mit vorgegebener abstrakter Gruppe, Compositio Math., 6 (1938), 239–250.
H.A. Gindler, Review 91, Mathematical Reviews 31 (1966).
F. Harary, Combinatorial problems on graphical enumeration, Chapter 6 in E.F. Bechenbach (Ed.): Applied Combinatorial Mathematics, Wiley, New York, 1964.
F. Harary and E.M. Palmer, The smallest graph whose group is cyclic, Czechoslovak Math. J., 16 (91) (1966), 70–71.
R.L. Hemminger, On the group of a directed graph, Canad. J. Math., 18 (1966), 211–220.
H. Izbicki, Reguläre Graphen beliebigen Grades mit vorgegebenen Eigenschaften, Monatsh. Math., 64 (1960), 15–21.
I.N. Kagno, Linear graphs of degree ≤ 6 and their groups, Amer. J. Math., 68 (1946), 505–520. Corrections, Amer. J. Math., 77 (1955), 392.
D. König, Theorie der endlichen und unendlichen Graphen, Leipzig, 1936; reprinted by Chelsea, New York, 1950.
M.H. McAndrew, On graphs with transitive automorphism groups, Notices Amer. Math. Soc., 12 (1965), 575.
L.A. Nowitz, On the non-existence of graphs with transitive generalized dicyclic groups, J. Combinatorial Theory, 4 (1968), 49–51.
O. Ore, Theory of graphs, Amer. Math. Soc. Colloq. Publ. 38, Providence, 1962.
G. Sabidussi, Graphs with given group and given graph theoretical properties, Canad. J. Math., 9 (1957), 515–525.
G. Sabidussi, Vertex-transitive graphs, Monatsh. Math., 68 (1964), 426–438. (see also [6][13])
J. Sheehan, The number of graphs with a given automorphism group, Canad. J. Math., 20 (1968), 1068–1076.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1969 Springer-Verlag
About this paper
Cite this paper
Bouwer, I.Z. (1969). Section graphs for finite permutation groups. In: Chartrand, G., Kapoor, S.F. (eds) The Many Facets of Graph Theory. Lecture Notes in Mathematics, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060105
Download citation
DOI: https://doi.org/10.1007/BFb0060105
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04629-5
Online ISBN: 978-3-540-36161-9
eBook Packages: Springer Book Archive