Abstract
The Reconstruction Conjecture for squares of trees is proved. The proof uses the reconstructibility of trees from their end-point deleted subgraphs. It is also proved that a graph can have at most one tree as a square root. The main result follows from (i) recognisability of squares of trees, (ii) constructing the (unique) tree square root of a graph, and (iii) reconstructibility of trees from their end-point deleted subgraphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. A. Bondy and R. L. Hemminger, Graph reconstruction: A survey, J. Graph Theory, 3 (1977), 227–268.
S. K. Gupta, On the Reconstruction Conjecture in Graph Theory, Ph. D. Thesis, Indian Institute of Technology, Delhi, 1978.
F. Harary and E. Palmer, The reconstruction of a tree from its maximal subtrees, Can. J. Math., 18 (1966), 803–810.
F. Harary, Graph Theory, Addison Wesley, Reading, Massachusetts, 1969.
A. Mukhopadhyaya, The square root of a graph, J. Comb. Theory, 2 (1967), 290–295.
I. Ross and F. Harary, The square of a tree, Bell Syst. Tech. J., 39 (1960), 641–647.
S. M. Ulam, A Collection of Mathematical Problems, Wiley (Interscience), New York (1960), p. 29.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Gupta, S.K. (1984). Reconstruction conjecture for square of a tree. In: Koh, K.M., Yap, H.P. (eds) Graph Theory Singapore 1983. Lecture Notes in Mathematics, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0073126
Download citation
DOI: https://doi.org/10.1007/BFb0073126
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13368-1
Online ISBN: 978-3-540-38924-8
eBook Packages: Springer Book Archive