Iterated joining of rooted trees

DOI10.1007/s00373-012-1178-7zbMath1272.05025OpenAlexW2019227833MaRDI QIDQ367061

Virgilio Pannone, Paolo Dulio

Publication date: 26 September 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1178-7

zbMATH Keywords

treecentergenerating functionpathjoiningcaterpillarpath-congruence

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eccentricity-approximating trees in chordal graphs
• Trees with the same degree sequence and path numbers
• Joining caterpillars and stability of the tree center
• Non-isomorphic caterpillars with identical subtree data
• Counterexamples to randić's conjecture on distance degree sequences for trees
• Regular graphs having the same path layer matrix
• On the number of vertices with specified eccentricity

This page was built for publication: Iterated joining of rooted trees