Extremal f-trees and embedding spaces for molecular graphs

DOI10.1016/0166-218X(83)90041-0zbMath0505.05027MaRDI QIDQ1835925

Louis V. Quintas, John W. Kennedy

Publication date: 1983

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

molecular treesdistance degree sequenceembedding trees in lattice-graphs

Mathematics Subject Classification ID

Trees (05C05) Classical equilibrium statistical mechanics (general) (82B05) Graph theory (05C99)

Related Items

Decompositions into linear forests and difference labelings of graphs, Some applications of graph theory to the study of polymer configuration, Gridline indifference graphs, Highly irregular m-chromatic graphs, \(k\)-connectivity in random graphs, Graphs and degree sequences. I, Distance degree regular graphs and distance degree injective graphs: an overview, Counting and coding identity trees with fixed diameter and bounded degree, Regularizing irregular graphs, Contact patterns of equal nonoverlapping spheres

Cites Work

• On graphs which contain all small trees
• The Counting and Coding of Trees of Fixed Diameter
• Some Basic Definitions in Graph Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item