The ally-reconstruction number of a tree with five or more vertices is three
From MaRDI portal
Publication:3483309
DOI10.1002/jgt.3190140203zbMath0704.05037OpenAlexW1984659116MaRDI QIDQ3483309
Publication date: 1990
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140203
Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (7)
A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint ⋮ Complexity results in graph reconstruction ⋮ The centroidal branches of a separable graph are edge reconstructible ⋮ Families of pairs of graphs with a large number of common cards ⋮ Degree-associated reconstruction number of graphs ⋮ Reconstructing trees from two cards ⋮ Adversary degree associated reconstruction number of graphs
Cites Work
This page was built for publication: The ally-reconstruction number of a tree with five or more vertices is three
