Reconstruction of p-disconnected graphs

2008/04/25 by Pavel Skums, Skums, Pavel
Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Finite Group Theory Research #math.CO #msc:05C60

paper · pdf · doi:10.48550/arxiv.0804.4093

7 pages

arxiv created 2008/04/25 · arxiv updated 2009/12/01

Abstract

We prove that Kelly-Ulam conjecture is true for p-disconnected graphs.

Related

• Ulam's Conjecture is True for Connected Graphs
• Reconstruction and Edge Reconstruction of Triangle-free Graphs
• Reconstructing edge-deleted unicyclic graphs
• Proof of Kelly-Ulam Conjecture
• A Simple Explanation for the Reconstruction of Graphs