Comparison of Two Techniques for Proving Nonexistence of Strongly Regular Graphs

摘要

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.