Dissimilarity Characteristic Theorems for Graphs

DOI10.2307/2032979MaRDI QIDQ3265304zbMATH OpenOpenAlexFDO

Authors Robert Z. Norman, Frank Harary

Publication date 1960

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

zbMATH Keywords

topology

Cites work

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

Cited in

(7)

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

This page was built for publication: Dissimilarity Characteristic Theorems for Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3265304)