Skip to main content
Springer Nature Link
Log in

Algorithm 28 algorithm for generating graphs of a given partition

Algorithmus zur Konstruktion von Graphen mit vorgegebener Partition

  • Algorithm
  • Published:
Computing Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

An algorithm which produces with comparatively little redundancy all simple graphs realizing a given partition is discussed, and a FORTRAN implementation is given. The program generates all graphs of order 8 in approximately 40 seconds on an ICL 1906A computer.

Zusammenfassung

Es wird ein Algorithmus zur Konstruktion aller (schlichten) Graphen, die eine vorgegebene Partition realisieren, diskutiert. Bei der Konstruktion treten im allgemeinen Wiederholungen von isomorphen graphen auf, deren Anzahl jedoch verhältnismäßig gering ist. Es wird auch ein FORTRAN-Programm angegeben, mit Hilfe dessen auf einem ICL 1906-A-Computer alle Graphen der Ordnung 8 in etwa 40 Sekunden produziert wurden.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Corneil, D. G., Gotlieb, C. C.: An Efficient Algorithm for Graph Isomorphism. JACM17, 51–64 (1970).

    Google Scholar 

  2. Hakimi, S.: On the Realizability of a Set of Integers as Degrees of the Vertices of a Graph. J. SIAM Appl. Math.10, 496–506 (1962).

    Google Scholar 

  3. Harary, F.: Graph Theory. Addison-Wesley 1969.

  4. Harary, F.: The Number of Linear, Directed, Rooted and Connected Graphs. Trans. Amer. Math. Soc.78, 445–463 (1955).

    Google Scholar 

  5. Heap, B. R.: The Production of Graphs by Computer, in: Graph Theory and Computing (Read, R. C., ed.), pp. 47–62. Academic Press 1972.

  6. James, K. R., Riha, W.: The Production of Trees and Rooted Trees of Order ≤15, Classified According to Partition. Report No. 47, Centre for Computer Studies, University of Leeds. 1974.

  7. Parthasarathy, K. R.: Enumeration of Ordinary Graphs with Given Partition. Canad. J. Math.20, 40–47 (1968).

    Google Scholar 

  8. Riha, W., James, K. R.: The Production of Graphs Realizing a Given Partition. Report No. 43, Centre for Computer Studies, University of Leeds, 1974.

  9. Riha, W., James, K. R.: Efficient Algorithms for Doubly and Multiply Restricted Partitions. Computing16, 163–168 (1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Computer Studies, University of Leeds, LS2 9JT, Leeds, England

    K. R. James &  W. Riha

Authors
  1. K. R. James
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. W. Riha
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

James, K.R., Riha, W. Algorithm 28 algorithm for generating graphs of a given partition. Computing 16, 153–161 (1976). https://doi.org/10.1007/BF02241986

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords