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
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distance regular graphs of diameter 3 and strongly regular graphs
- Primitive rank 3 groups on symmetric designs
- Construction of strongly regular graphs using affine designs
- Spreads in strongly regular graphs
- Strongly regular graphs
- Strongly Regular Graphs Derived from Combinatorial Designs
- Orthogonal partitions in designed experiments
- 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
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
Recommendations
- A generalization of strongly regular graphs 👍 👎
- On generalized strongly regular graphs 👍 👎
- Title not available (Why is that?) 👍 👎
- A prolific construction of strongly regular graphs with the \(n\)-e. c. property 👍 👎
- Title not available (Why is that?) 👍 👎
- On highly regular strongly regular graphs 👍 👎
- Some characterizations of strongly regular graphs 👍 👎
- Title not available (Why is that?) 👍 👎
- Some new strongly regular graphs 👍 👎
- Title not available (Why is that?) 👍 👎
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)
