7 research outputs found
Stronger reconstruction of distance-hereditary graphs
A graph is said to be set-reconstructible if it is uniquely determined up to isomorphism from the set S of its non-isomorphic one-vertex deleted unlabeled subgraphs. Harary’s conjecture asserts that every finite simple undirected graph on four or more vertices is set-reconstructible. A graph G is said to be distance-hereditary if for all connected induced subgraph F of G, dF (u, v) = dG(u, v) for every pair of vertices u, v ∈ V (F). In this paper, we have proved that the class of all 2-connected distance-hereditary graphs G with diam(G) = 2 or diam(G) = diam(Ḡ) = 3 are set-reconstructible.The second author is supported by the University Grants Commission, Government of India. (F./2017-18/NFO-2017-18-OBC-TAM-53159)Publisher's Versio
Isomorph-free generation of 2-connected graphs with applications
Many interesting graph families contain only 2-connected graphs, which have
ear decompositions. We develop a technique to generate families of unlabeled
2-connected graphs using ear augmentations and apply this technique to two
problems. In the first application, we search for uniquely K_r-saturated graphs
and find the list of uniquely K_4-saturated graphs on at most 12 vertices,
supporting current conjectures for this problem. In the second application, we
verifying the Edge Reconstruction Conjecture for all 2-connected graphs on at
most 12 vertices. This technique can be easily extended to more problems
concerning 2-connected graphs.Comment: 15 pages, 3 figures, 4 table