Skip to main content

Section graphs for finite permutation groups

Part of the Lecture Notes in Mathematics book series (LNM,volume 110)

Keywords

  • Permutation Group
  • Regular Representation
  • Permutation Subgroup
  • Mathematical Review
  • Section Graph

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.A. Beaumont and R.P. Peterson, Set-transitive permutation groups, Canad. J. Math, 7 (1955), 34–42.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. I.Z. Bouwer, Section graphs for finite permutation groups, J. Combinatorial Theory, to appear.

    Google Scholar 

  3. C.-Y. Chao, On a theorem of Sabidussi, Proc. Amer. Math. Soc., 15 (1964), 291–292. (see also [6][13])

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. C.-Y. Chao, On groups and graphs, Trans. Amer. Math. Soc., 118 (1965), 488–497.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. R. Frucht, Herstellung von Graphen mit vorgegebener abstrakter Gruppe, Compositio Math., 6 (1938), 239–250.

    MathSciNet  MATH  Google Scholar 

  6. H.A. Gindler, Review 91, Mathematical Reviews 31 (1966).

    Google Scholar 

  7. F. Harary, Combinatorial problems on graphical enumeration, Chapter 6 in E.F. Bechenbach (Ed.): Applied Combinatorial Mathematics, Wiley, New York, 1964.

    Google Scholar 

  8. F. Harary and E.M. Palmer, The smallest graph whose group is cyclic, Czechoslovak Math. J., 16 (91) (1966), 70–71.

    MathSciNet  MATH  Google Scholar 

  9. R.L. Hemminger, On the group of a directed graph, Canad. J. Math., 18 (1966), 211–220.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. H. Izbicki, Reguläre Graphen beliebigen Grades mit vorgegebenen Eigenschaften, Monatsh. Math., 64 (1960), 15–21.

    CrossRef  MathSciNet  MATH  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. D. König, Theorie der endlichen und unendlichen Graphen, Leipzig, 1936; reprinted by Chelsea, New York, 1950.

    Google Scholar 

  13. M.H. McAndrew, On graphs with transitive automorphism groups, Notices Amer. Math. Soc., 12 (1965), 575.

    Google Scholar 

  14. L.A. Nowitz, On the non-existence of graphs with transitive generalized dicyclic groups, J. Combinatorial Theory, 4 (1968), 49–51.

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. O. Ore, Theory of graphs, Amer. Math. Soc. Colloq. Publ. 38, Providence, 1962.

    Google Scholar 

  16. G. Sabidussi, Graphs with given group and given graph theoretical properties, Canad. J. Math., 9 (1957), 515–525.

    CrossRef  MathSciNet  MATH  Google Scholar 

  17. G. Sabidussi, Vertex-transitive graphs, Monatsh. Math., 68 (1964), 426–438. (see also [6][13])

    CrossRef  MathSciNet  MATH  Google Scholar 

  18. J. Sheehan, The number of graphs with a given automorphism group, Canad. J. Math., 20 (1968), 1068–1076.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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