Abstract
The Reconstruction Conjecture is one of the most engaging problems under the domain of Graph Theory. The conjecture proposes that every graph with at least three vertices can be uniquely reconstructed given the multiset of subgraphs produced by deleting each vertex of the original graph one by one. This conjecture has been proven true for several infinite classes of graphs, but the general case remains unsolved. In this paper we will outline the problem and give a practical method for reconstructing a graph from its node-deleted.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Carrillo, H., Lipman, D.: The multiple sequence alignment problem in biology. SIAM Journal of Applied Mathematics 48, 1073–1082 (1988)
Clark, J., Holton, D.A.: A First Look At Graph Theory. World Scientific Publishing Company (1995)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. Phi Learning (2010)
Farrell, E.J., Wahid, S.A.: On the reconstruction of the matching polynomial and the reconstruction conjecture. Int. J. Math. Math. Sci. 10, 155–162 (1987)
Farrell, E.J.: Introduction to Matching Polynomials. J. Combinatorial Theory B 27, 75–86 (1979)
Gutman, I., Cvetkovic, D.M.: The Reconstruction Problem for Characteristic Polynomials of Graphs. Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz. No., 498–541 (1975)
Harary, F.: On the reconstruction of a graph from a collection of subgraphs. In: Fiedler, M. (ed.) Theory of Graphs and its Applications, pp. 47–52. Czechoslovak Academy of Sciences, Prague (1964)
Harary, F.: A Survey of the Reconstruction Conjecture. In: Bari, R., Harary, F. (eds.) Graphs and Combinatorics, pp. 18–28. Springer, New York (1974)
Hemaspaandraa, E., Hemaspaandrab, L.A., Radziszowskia, S.P., Tripathib, R.: Complexity results in graph reconstruction. Discrete Appl. Math. 155, 103–118 (2004)
Jerrum, M.: Two-dimensional monomer-Dimer systems are computationally intractable. Journal of Statistical Physics 48(1), 121–134 (1987)
Kelly, P.J.: On isometric transformations, Ph.D. thesis, University of Wisconsin, USA (1942)
Manvel, B.: Reconstruction of graphs: Progress and prospects. Congressus Numerantium 63, 177–187 (1988)
Nash-Williams, C.S.J.A.: The reconstruction problem. In: Selected Topics in Graph Theory, pp. 205–236. Academic Press (1978)
Ramachandran, S.: Graph Reconstruction - Some New Developments. AKCE J. Graphs. Combin. 1(1), 51–61 (2004)
Tutte, W.T.: All the King’s Horses. In: Bondy, J.A., Murty, U.R.S. (eds.) Graph Theory and Related Topics, pp. 15–33. Academic Press (1979)
Ulam, S.: A Collection of Mathematical Problems. Interscience Publishers, New York (1960)
Yongzhi, Y.: The reconstruction conjecture is true if all 2-connected graphs are reconstructible. Journal of Graph Theory 12(2), 237–243 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Banerjee, S., SenSarma, D., Basuli, K., Naskar, S., Sarma, S.S. (2012). The Reconstruction Conjecture. In: Meghanathan, N., Chaki, N., Nagamalai, D. (eds) Advances in Computer Science and Information Technology. Computer Science and Information Technology. CCSIT 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27317-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-27317-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27316-2
Online ISBN: 978-3-642-27317-9
eBook Packages: Computer ScienceComputer Science (R0)