Counting and coding identity trees with fixed diameter and bounded degree

DOI10.1016/0166-218X(84)90063-5zbMath0533.05034OpenAlexW2035627980WikidataQ127120469 ScholiaQ127120469MaRDI QIDQ789398

John W. Kennedy, Claude W. Haigh, Louis V. Quintas

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0166-218x(84)90063-5

zbMATH Keywords

bounded maximum degreeenumeration of tree classesIdentity trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cites Work

• The distribution of degrees in a large random tree
• Parallel concepts in graph theory
• Extremal f-trees and embedding spaces for molecular graphs
• The number of trees
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. III
• The Counting and Coding of Trees of Fixed Diameter
• Some Basic Definitions in Graph Theory
• Asymmetric graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting and coding identity trees with fixed diameter and bounded degree