Strongly regular graphs with no triangles
Abstract
A simplified version of the theory of strongly regular graphs is developed for the case in which the graphs have no triangles. This leads to (i) direct proofs of the Krein conditions, and (ii) the characterization of strongly regular graphs with no triangles such that the second subconstituent is also strongly regular. The method also provides an effective means of listing feasible parameters for such graphsSimilar works
This paper was published in LSE Research Online.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.