S. Monikandan

Graphs of diameter three are recognizable

A vertex-deleted subgraph (or card ) G − v of a graph G is the unlabelled subgraph obtained from G by deleting the vertex v and all edges incident with v . The collection of all cards of G is the deck of G . A graph H is a reconstruction of G if H has the same deck as G . A graph...