Combinatorics and Graph Theory

1403 Submissions

[1] viXra:1403.0965 [pdf] submitted on 2014-03-28 22:18:01

On the Reconstruction of Graphs

Authors: Dhananjay P. Mehendale
Comments: 2 pages,

Reconstruction conjecture asks whether it is possible to reconstruct a unique (up to isomorphism) graph from set of its one vertex deleted subgraphs. We show here the validity of reconstruction conjecture for every connected graph which is uniquely reconstructible from the set of all its spanning trees. We make use of a well known result, namely, the reconstruction of a tree from the deck of its pendant point deleted subtrees.
Category: Combinatorics and Graph Theory