Skip to main content
SpringerLink
Log in

A survey of graph generation techniques

  • Invited Papers
  • Conference paper
  • First Online:
Book cover Combinatorial Mathematics VIII

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

Abstract

This talk deals with various recently-developed methods for generating, by computer, catalogues of all graphs of some given kind. This includes discussion of the generation of graphs, digraphs, tournaments, self-complementary graphe, trees, and others. The present state of the art of graph generation is presented, together with some ideas on future prospects.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baker, H.H., Dewdney, A.K., Szilard, A.L., Generating the nine-point graphs, Math. Comp. 28 (127), (1974) 833–838.

    Article  MathSciNet  MATH  Google Scholar 

  2. Baraev, A.M., Faradzhev, I.A., The construction and computer investigation of homogeneous and inhomogeneous bipartile graphs, Algorithmic Studies in Combinatorics (Internat. Colloq. Combinatorics and Graph Theory, Orsay (1976) 25–60, 185.

    Google Scholar 

  3. Bussemaker, F.C., Cobeljic, S., Cvetkovic, D.M., Seidel, J.J., Computer investigation of cubic graphs, T.H.-Report 76-WSK-01 Technological University, Eindhoven, Department of Mathematics, 1976.

    MATH  Google Scholar 

  4. Colbourn, C.J., Read, R.C., Orderly algorithms for graph generation, Intern. J. Computer Math, 7A (1979) 167–172.

    Article  MathSciNet  MATH  Google Scholar 

  5. Colbourn, C.J., Read, R.C., Orderly algorithms for generating restricted classes of graphs, J. Graph Theory 3 (1979) 187–195.

    Article  MathSciNet  MATH  Google Scholar 

  6. Faradzhev, I.A., Constructive enumeration of combinatorial objects, Internat. Colloq. CNRS No. 260, Combinatoire et Theorie des Graphes, Paris (1976), 131–135.

    Google Scholar 

  7. Faradzhev, I.A., Generation of non-isomorphic graphs with a given distribution of the degree of vertices, Algorithmic Studies in Combinatorics, Internat. Colloq. Combinatorics and Graph Theory, Orsay (1976) 11–19, 185.

    Google Scholar 

  8. Faradzhev, I.A., Constructive enumeration of homogeneous graphs, Uspehi Mat. Nauk. 31 (1976) 246.

    MathSciNet  Google Scholar 

  9. Faradzhev, I.A., The obtaining of a complete list of self-complementary grahs on up to 12 vertices, Algorithmic studies in Combinatorics, Internat. Colloq. Combinatorics and Graph Theory, Orsay (1976) 69–75, 186.

    Google Scholar 

  10. Farrell, E.J., Computer implementation of an algorithm for generating compositions and applications to problems in graph theory, M. Math. Thesis, University of Waterloo, 1971.

    Google Scholar 

  11. Frazer, R.J., Graduate course project, Department of Combinatorics and Optimization, University of Waterloo, unpublished (May 1973).

    Google Scholar 

  12. Heap, B.R., The production of graphs by computer, Graph Theory and Computing (ed. R.C. Read), Academic Press (1972) 47–62.

    Google Scholar 

  13. James, K.R., Riha, W., Algorithm 28: Algorithm for generating graphs of a given partition. Computing 16 (1976) 153–161.

    Article  MATH  Google Scholar 

  14. Kagno, I., Linear graphs of degree less than 7 and their groups, Amer. J. Math. 68 (1946) 505–529.

    Article  MathSciNet  MATH  Google Scholar 

  15. Kropar, M., Read, R.C., On the construction of the self-complementary graphs on 12 nodes, J. Graph Theory 3 (1979) 111–125.

    Article  MathSciNet  MATH  Google Scholar 

  16. McWha, P., Graduate course project, Department of Combinatorics and Optimization, University of Waterloo, unpublished (May 1973).

    Google Scholar 

  17. Morris, P.A., A catalogue of trees on n nodes, n<14, Mathematical observations, research and other notes, Paper No. 1 StA (mimeographed), Publications of the Department of Mathematics, University of the West Indies, 1971.

    Google Scholar 

  18. Morris, P.A., Self-complementary graphs and digraphs, Math. Comp. 27 (1973) 216–217.

    Article  Google Scholar 

  19. Proskurowski, A., On the generation of binary trees, J. ACM 27 (1980) 1–2.

    Article  MathSciNet  MATH  Google Scholar 

  20. Read, R.C., The production of a catalogue of digraphs on 5 nodes, Report UWI/CC1, Computing Centre, University of the West Indies.

    Google Scholar 

  21. Read, R.C., Every one a winner, or how to avoid isomorphism search when cataloguing combinatorial configurations, Annals of Discrete Math. 2 (1978) 107–120.

    Article  MathSciNet  MATH  Google Scholar 

  22. Read, R.C., Corneil, D.G., The graph isomorphism disease, J. Graph Theory 1 (1977) 339–363.

    Article  MathSciNet  MATH  Google Scholar 

  23. Solomon, M., Finkel, R.A., A note on enumerating binary trees, J. ACM 27 (1980) 3–5.

    Article  MathSciNet  Google Scholar 

  24. Stein, M.L., Stein, P.R., Enumeration of linear graphs and connected linear graphs up to p=18 points, Report LA-3775 UC-32, Mathematics and Computers, TID-4500, Los Almos Scientific Laboratory of the University of California.

    Google Scholar 

  25. Thompson, T., Undergraduate course project, Department of Combinatorics and Optimization, University of Waterloo, unpublished (1978).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Ronald C. Read

Authors
  1. Ronald C. Read
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kevin L. McAvaney

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Read, R.C. (1981). A survey of graph generation techniques. In: McAvaney, K.L. (eds) Combinatorial Mathematics VIII. Lecture Notes in Mathematics, vol 884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0091809

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10883-2

  • Online ISBN: 978-3-540-38792-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation