The Counting and Coding of Trees of Fixed Diameter
From MaRDI portal
Publication:4044615
DOI10.1137/0128033zbMath0293.05137MaRDI 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
05C05: Trees
05C30: Enumeration in graph theory
94B99: Theory of error-correcting codes and error-detecting codes
Related Items
Counting and coding identity trees with fixed diameter and bounded degree, Extremal f-trees and embedding spaces for molecular graphs, An exponential formula for polynomial vector fields. II: Lie series, exponential substitution, and rooted trees, Coding and generation of nonisomorphic trees