The Enumeration of Homeomorphically Irreducible Star Graphs
- 1 September 1966
- journal article
- research article
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 7 (9) , 1582-1587
- https://doi.org/10.1063/1.1705068
Abstract
In expressing properties of interacting systems in the form of series, in many cases only summation over star graphs is involved. The identification and classification of such graphs is simplified by reducing them to homeomorphically irreducible stars. These graphs can be regarded as being all the possible different topological types of star. A method is described which has been used to produce all the different homeomorphically irreducible stars which have cyclomatic numbers ≤ 5. In particular, it has been established that there are 118 such graphs with cyclomatic number 5, 111 of which are planar. Diagrams of these graphs are appended, and a table of their k weights, which are needed for obtaining series for percolation processes, is also given. An extension of the method has been used to count the numbers of homeomorphically irreducible stars containing up to 8 vertices and 12 edges, a table of which is given.Keywords
This publication has 6 references indexed in Scilit:
- On Ordering and Identifying Undirected Linear GraphsJournal of Mathematical Physics, 1966
- Lattice Constant Systems and Graph TheoryJournal of Mathematical Physics, 1966
- Percolation Processes. I. Low-Density Expansion for the Mean Number of Clusters in a Random MixtureJournal of Mathematical Physics, 1966
- Permutations by InterchangesThe Computer Journal, 1963
- Lattice Statistics-A Review and an Exact Isotherm for a Plane Lattice GasJournal of Mathematical Physics, 1963
- On the theory of cooperative phenomena in crystalsAdvances in Physics, 1960