A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
From MaRDI portal
Publication:871281
DOI10.1007/s10801-006-0030-7zbMath1111.05101OpenAlexW2033271298MaRDI QIDQ871281
Publication date: 16 March 2007
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-006-0030-7
Related Items (13)
Implementing Brouwer's database of strongly regular graphs ⋮ Association schemes on 28 points as mergings of a half-homogeneous coherent configuration ⋮ New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs ⋮ Strongly regular graphs from classical generalized quadrangles ⋮ The smallest strictly Neumaier graph and its generalisations ⋮ A new construction of strongly regular graphs with parameters of the complement symplectic graph ⋮ On the order of antipodal covers ⋮ On a family of highly regular graphs by Brouwer, Ivanov, and Klin ⋮ Some implications on amorphic association schemes ⋮ Developments on spectral characterizations of graphs ⋮ Strongly regular tri-Cayley graphs ⋮ On highly regular strongly regular graphs ⋮ Strongly regular graphs with the \(7\)-vertex condition
Cites Work
- Orthogonal partitions in designed experiments
- Spreads in strongly regular graphs
- A prolific construction of strongly regular graphs with the \(n\)-e. c. property
- Distance regular graphs of diameter 3 and strongly regular graphs
- Strongly regular graphs
- A root graph that is locally the line graph of the Petersen graph
- Strongly Regular Graphs Derived from Combinatorial Designs
- Construction of strongly regular graphs using affine designs
- Primitive rank 3 groups on symmetric designs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
