Comparison of two techniques for proving nonexistence of strongly regular graphs

From MaRDI portal




Abstract: 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.









This page was built for publication: Comparison of two techniques for proving nonexistence of strongly regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659689)