Contents

Ars Combinatoria

  • Research article

All Graphs are Set Reconstructible if all \(2\)-Connected Graphs are Set Reconstructible

S. Ramachandran1, S. Monikandan1
1Department of Mathematics, Vivekananda College, Agasieeswaram-629 701, Kanyakumari, T.N. State, INDIA.
  • Published: 30/04/2007

Abstract

A graph is called set reconstructible if it is determined uniquely (up to isomorphism) by the set of its vertex-deleted subgraphs. We prove that some classes of separable graphs with a unique endvertex are set reconstructible and show that all graphs are set reconstructible if all \(2\)-connected graphs are set reconstructible.

Citation
S. Ramachandran, S. Monikandan. All Graphs are Set Reconstructible if all \(2\)-Connected Graphs are Set Reconstructible[J], Ars Combinatoria, Volume 083. 341-352. .