The Counting and Coding of Trees of Fixed Diameter

DOI10.1137/0128033zbMath0293.05137OpenAlexW2041068814MaRDI QIDQ4044615

John W. Kennedy, Manfred Gordon

Publication date: 1975

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0128033

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (7)

Enumerating the total colorings of a polyhedron and application to polyhedral links ⋮ Enumerating stereo-isomers of tree-like polyinositols ⋮ An exponential formula for polynomial vector fields. II: Lie series, exponential substitution, and rooted trees ⋮ Enumerating tree-like polyphenyl isomers ⋮ Coding and generation of nonisomorphic trees ⋮ Extremal f-trees and embedding spaces for molecular graphs ⋮ Counting and coding identity trees with fixed diameter and bounded degree

This page was built for publication: The Counting and Coding of Trees of Fixed Diameter