Reconstruction of p-disconnected graphs
classification
🧮 math.CO
keywords
graphsp-disconnectedconjecturekelly-ulamprovereconstructiontrue
read the original abstract
We prove that Kelly-Ulam conjecture is true for p-disconnected graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.