The graph reconstruction number

DOI10.1002/jgt.3190090403zbMath0664.05043OpenAlexW2098123445MaRDI QIDQ3815338

Michael J. Plantholt, Frank Harary

Publication date: 1985

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190090403

zbMATH Keywords

reconstruction numberminimum number of point-deleted subgraphs

Mathematics Subject Classification ID

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

Related Items (19)

The forcing vertex detour monophonic number of a graph ⋮ Complexity results in graph reconstruction ⋮ Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices ⋮ Degree associated edge reconstruction number of graphs ⋮ Unnamed Item ⋮ Lexicographic products with high reconstruction numbers ⋮ Nonsplit Graphs with Split Maximal Induced Subgraphs ⋮ Unnamed Item ⋮ The adversary degree-associated reconstruction number of double-brooms ⋮ Reconstruction number of graphs with unique pendant vertex ⋮ A note on the adversary degree associated reconstruction number of graphs ⋮ Degree-associated reconstruction number of graphs ⋮ Reconstructing finite sets of points in \(R^n\) up to groups of isometries ⋮ Graphs with arbitrarily large adversary degree associated reconstruction number ⋮ The class reconstruction number of maximal planar graphs ⋮ Adversary degree associated reconstruction number of graphs ⋮ Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph ⋮ Degree associated edge reconstruction number of split graphs with biregular independent set is one ⋮ On a reconstruction problem of Harary and Manvel

Cites Work

• Unnamed Item

This page was built for publication: The graph reconstruction number