Distance-Regular Graphs with Diameter Three
From MaRDI portal
Publication:4742829
DOI10.1016/S0304-0208(08)73254-7zbMATH Open0506.05057OpenAlexW108413068MaRDI QIDQ4742829FDOQ4742829
Authors: Norman L. Biggs 
Publication date: 1982
Published in: North-Holland Mathematics Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73254-7
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Paths and cycles (05C38) Graph theory (05C99)
Cited In (16)
- D-magic strongly regular graphs
- Overlarge sets and partial geometries
- On almost nexus semi-symmetric designs
- Extending generalized quadrangles
- Distance regular graphs of diameter 3 and strongly regular graphs
- Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3
- Covers of graphs and EGQs
- Lower bounds for Ramsey numbers and association schemes
- Distance-transitive graphs of valency 5, 6 and 7
- The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures
- Distance–regular graphs having theM-property
- Constructing the vertex-transitive graphs of order 24
- Distance regular covers of the complete graph
- Boundary Value Problems on Finite Networks
- Distance-regular graphs with small number of distinct distance eigenvalues
- Second neighbourhoods of strongly regular graphs
This page was built for publication: Distance-Regular Graphs with Diameter Three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4742829)
