The ally-reconstruction number of a tree with five or more vertices is three

DOI10.1002/JGT.3190140203MaRDI QIDQ3483309zbMATH OpenOpenAlexFDO

Authors Wendy Myrvold

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

zbMATH Keywords

reconstruction number

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites work

• A congruence theorem for trees
• Graph theory with applications
• scientific article; zbMATH DE number 4077274 (Why is no real title available?)

Cited in

(8)

• The centroidal branches of a separable graph are edge reconstructible
• A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint
• Families of pairs of graphs with a large number of common cards
• Reconstructing trees from two cards
• Adversary degree associated reconstruction number of graphs
• Degree-associated reconstruction number of graphs
• Reconstruction from smaller cards
• Complexity results in graph reconstruction

This page was built for publication: The ally-reconstruction number of a tree with five or more vertices is three

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