A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
From MaRDI portal
Publication:871281
DOI10.1007/S10801-006-0030-7zbMATH Open1111.05101OpenAlexW2033271298MaRDI QIDQ871281FDOQ871281
Recommendations
- A generalization of strongly regular graphs
- On generalized strongly regular graphs
- scientific article; zbMATH DE number 3979110
- A prolific construction of strongly regular graphs with the \(n\)-e. c. property
- scientific article; zbMATH DE number 1817540
- On highly regular strongly regular graphs
- Some characterizations of strongly regular graphs
- scientific article; zbMATH DE number 4106910
- Some new strongly regular graphs
- scientific article; zbMATH DE number 3884175
Cites work
- scientific article; zbMATH DE number 1817540 (Why is no real title available?)
- scientific article; zbMATH DE number 3884175 (Why is no real title available?)
- scientific article; zbMATH DE number 3520420 (Why is no real title available?)
- scientific article; zbMATH DE number 3392464 (Why is no real title available?)
- A prolific construction of strongly regular graphs with the \(n\)-e. c. property
- A root graph that is locally the line graph of the Petersen graph
- Construction of strongly regular graphs using affine designs
- Distance regular graphs of diameter 3 and strongly regular graphs
- Orthogonal partitions in designed experiments
- Primitive rank 3 groups on symmetric designs
- Spreads in strongly regular graphs
- Strongly Regular Graphs Derived from Combinatorial Designs
- Strongly regular graphs
Cited in
(13)
- Some implications on amorphic association schemes
- On a family of highly regular graphs by Brouwer, Ivanov, and Klin
- On the order of antipodal covers
- Developments on spectral characterizations of graphs
- Strongly regular graphs with the \(7\)-vertex condition
- The smallest strictly Neumaier graph and its generalisations
- Strongly regular tri-Cayley graphs
- On highly regular strongly regular graphs
- New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
- Strongly regular graphs from classical generalized quadrangles
- A new construction of strongly regular graphs with parameters of the complement symplectic graph
- Association schemes on 28 points as mergings of a half-homogeneous coherent configuration
- Implementing Brouwer's database of strongly regular graphs
This page was built for publication: A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871281)
