Exhaustive Verification of Weak Reconstruction For Self Complementary Graphs

Details Exhaustive Verification of Weak Reconstruction For Self Complementary Graphs Exhaustive Verification of Weak Reconstruction For Self Complementary Graphs

2010-12-29

arxiv.org/abs/1012.5995v1

Presented as a poster in ICRTGC 2010

Computer Science

Discrete Mathematics

9 pages, 4 figures, Submitted to Special Issue of Cochin in Discrete Mathematics

Scientific paper

This paper presents an exhaustive approach for verification of the weak reconstruction of Self Complementary Graphs up to 17 vertices. It describes the general problem of the Reconstruction Conjecture, explaining the complexity involved in checking deck-isomorphism between two graphs. In order to improve the computation time, various pruning techniques have been employed to reduce the number of graph-isomorphism comparisons. These techniques offer great help in proceeding with a reconstructive approach. An analysis of the numbers involved is provided, along with the various limitations of this approach. A list enumerating the number of SC graphs up till 101 vertices is also appended.

Affiliated with

Also associated with

No associations

Rating

Exhaustive Verification of Weak Reconstruction For Self Complementary Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exhaustive Verification of Weak Reconstruction For Self Complementary Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exhaustive Verification of Weak Reconstruction For Self Complementary Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-611477