The Counting and Coding of Trees of Fixed Diameter

DOI10.1137/0128033MaRDI QIDQ4044615zbMATH OpenOpenAlexFDO

Authors Manfred Gordon, John W. Kennedy

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)

Cited in

(7)

• Extremal f-trees and embedding spaces for molecular graphs
• 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
• Enumerating the total colorings of a polyhedron and application to polyhedral links
• Enumerating stereo-isomers of tree-like polyinositols
• 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

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