On Ordering and Identifying Undirected Linear Graphs
- 1 September 1966
- journal article
- research article
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 7 (9) , 1588-1592
- https://doi.org/10.1063/1.1705069
Abstract
A general linear ordering relation is presented which completely orders any subset of the undirected linear graphs with the same number of vertices. The discussion is then specialized to the ordering and the identification of the unlabeled stars with no vertices of degree two, which faithfully represent the basic topologies of all stars.Keywords
This publication has 10 references indexed in Scilit:
- The Enumeration of Homeomorphically Irreducible Star 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
- Lattice Statistics of Hydrogen Bonded Crystals. I. The Residual Entropy of IceJournal of Mathematical Physics, 1966
- On hearing the shape of a drumJournal of Combinatorial Theory, 1966
- Lattice Statistics-A Review and an Exact Isotherm for a Plane Lattice GasJournal of Mathematical Physics, 1963
- Some Counting Theorems in the Theory of the Ising Model and the Excluded Volume ProblemJournal of Mathematical Physics, 1961
- On the theory of cooperative phenomena in crystalsAdvances in Physics, 1960
- COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. IVProceedings of the National Academy of Sciences, 1957
- COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. IProceedings of the National Academy of Sciences, 1956