Strongly Regular Graphs with No Triangles
classification
🧮 math.CO
keywords
graphsregularstronglytrianglescasecharacterizationconditionsdeveloped
read the original 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 graphs.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
The distance spectrum of the bipartite double cover of strongly regular graphs
The distance spectrum of B(G), the bipartite double cover of a strongly regular graph G with parameters (n,k,a,c), is explicitly determined from the spectrum of G.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.