Counting and coding identity trees with fixed diameter and bounded degree
type: Item
instance of: scholarly article
title: Counting and coding identity trees with fixed diameter and bounded degree
zbMATH Open document ID: 0533.05034
DOI: 10.1016/0166-218X(84)90063-5
author: Claude W. Haigh
author: John W. Kennedy
author: Louis V. Quintas
published in: Discrete Applied Mathematics
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3845612
zbMATH Keywords: enumeration of tree classes
zbMATH Keywords: Identity trees
zbMATH Keywords: bounded maximum degree
MaRDI profile type: Publication
cites work: The Counting and Coding of Trees of Fixed Diameter
cites work: Extremal f-trees and embedding spaces for molecular graphs
cites work: Q3936764
cites work: Q3941438
cites work: Q3874224
cites work: Parallel concepts in graph theory
cites work: Some Basic Definitions in Graph Theory
cites work: Q4774085
cites work: Q5682013
cites work: COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. III
cites work: Asymmetric graphs
cites work: Q5676231
cites work: Q4081275
cites work: The number of trees
cites work: The distribution of degrees in a large random tree
cites work: Q4091978
Wikidata QID: Q127120469
full work available at URL: 0166-218x(84)90063-5
OpenAlex ID: W2035627980
Recommended article: Bounds on the identifying codes in trees
Recommended article: Counting Bounded Tree Depth Homomorphisms
Recommended article: Minimal identifying codes in trees and planar graphs with large girth
Recommended article: Counting and Enumeration Problems with Bounded Treewidth
Recommended article: Identifying codes in trees and planar graphs
Recommended article: Coding and counting spanning trees in Kleitman-Golden graphs
Recommended article: Efficient Prüfer-like coding and counting labelled hypertrees
Recommended article: Efficient Prüfer-Like Coding and Counting Labelled Hypertrees
Recommended article: Q4856907
Recommended article: Q3115728
description: scientific article; zbMATH DE number 3845612