Dissimilarity Characteristic Theorems for Graphs

DOI10.2307/2032979zbMath0090.39304OpenAlexW4242307691MaRDI QIDQ3265304

Robert Z. Norman, Frank Harary

Publication date: 1960

Full work available at URL: https://doi.org/10.2307/2032979

zbMATH Keywords

topology

Related Items

The enumeration of tree-like polyhexes, Enumeration and 3D representation of the stereo-isomers of alkane molecules, On the cell-growth problem for arbitrary polygons, Constructing minimum changeover cost arborescenses in bounded treewidth graphs, Counting bridgeless graphs, Automorphism groups of graphs, On acyclic simplicial complexes

Cites Work

• The number of trees
• The dissimilarity characteristic of Husimi trees
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. II
• An Elementary Theorem on Graphs
• On the Number of Husimi Trees
• The Dissimilarity Characteristic of Linear Graphs