2000 character limit reached
Reconstruction Conjecture for Graphs Isomorphic to Cube of a Tree (1207.1875v1)
Published 8 Jul 2012 in cs.DM
Abstract: This paper proves the reconstruction conjecture for graphs which are isomorphic to the cube of a tree. The proof uses the reconstructibility of trees from their peripheral vertex deleted subgraphs. The main result follows from (i) characterization of the cube of a tree (ii) recognizability of the cube of a tree (iii) uniqueness of tree as a cube root of a graph G, except when G is a complete graph (iv) reconstructibility of trees from their peripheral vertex deleted subgraphs.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.