Skip to main content

The least number of edges for graphs having automorphism group of order three

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

Keywords

  • Automorphism Group
  • Cyclic Group
  • Identity Group
  • Regular Graph
  • Combinatorial Theory

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. Frucht, R., Herstellung von Graphen mit vorgegebener abstrakter Gruppe, Compositio Math. 6 (1938), 239–250.

    MathSciNet  MATH  Google Scholar 

  2. Frucht, R., Gewirtz, A., and Quintas, L. V., El número mínimo de líneas para grafos conexos con grupo de automorfismos de orden 3, Scientia, (in press).

    Google Scholar 

  3. Gewirtz, A., Hill, A., and Quintas, L. V., El número mínimo de puntos para grafos regulares y asimétricos, Scientia 138 (1969), 103–111.

    MathSciNet  Google Scholar 

  4. Gewirtz, A., Hill, A., and Quintas, L. V., Extremum problems concerning graphs and their groups, Proceedings of the Calgary International Conference on Combinatorial Structures and their Applications, Gordan and Breach, New York, 1970, 103–109.

    Google Scholar 

  5. Gewirtz, A. and Quintas, L. V., Connected extremal edge graphs having symmetric automorphism group, Recent Progress in Combinatorics (W. T. Tutte, ed.) Academic Press, New York, 1969, 223–227.

    Google Scholar 

  6. Harary, F., Graph Theory, Addison-Wesley, Reading, 1969.

    MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  8. Harary, F. and Prins, G., The number of homeomorphically irreducible trees, and other species, Acta Math. 101 (1959), 141–162.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Meriwether, R. L., Smallest graphs with a given cyclic group (1963) unpublished, but see Math Reviews 33 (1967) #2563.

    Google Scholar 

  10. Quintas, L. V., Extrema concerning asymmetric graphs, J. Combinatorial Theory 3 (1967), 57–82.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. Quintas, L. V., The least number of edges for graphs having symmetric automorphism group, J. Combinatorial Theory 5 (1968), 115–125.

    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

© 1971 Springer-Verlag

About this paper

Cite this paper

Frucht, R., Gewirtz, A., Quintas, L.V. (1971). The least number of edges for graphs having automorphism group of order three. In: Capobianco, M., Frechen, J.B., Krolik, M. (eds) Recent Trends in Graph Theory. Lecture Notes in Mathematics, vol 186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0059428

Download citation

  • DOI: https://doi.org/10.1007/BFb0059428

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-05386-6

  • Online ISBN: 978-3-540-36508-2

  • eBook Packages: Springer Book Archive