Comparison of two techniques for proving nonexistence of strongly regular graphs

Details Comparison of two techniques for proving nonexistence of strongly regular graphs Comparison of two techniques for proving nonexistence of strongly regular graphs

2009-06-30

arxiv.org/abs/0906.5389v1

Mathematics

Combinatorics

Scientific paper

We show that the method of counting closed walks in strongly regular graphs
rules out no parameter sets other than those ruled out by the method of
counting eigenvalue multiplicities.

Affiliated with

Also associated with

No associations

Rating

Comparison of two techniques for proving nonexistence of strongly regular 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 Comparison of two techniques for proving nonexistence of strongly regular graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comparison of two techniques for proving nonexistence of strongly regular graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-439984