Distance-Regular Graphs with Diameter Three

DOI10.1016/S0304-0208(08)73254-7MaRDI QIDQ4742829zbMATHOpenAlexFDO

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

zbMATH Keywords

strongly regular graphdistance-regular graphclassification schemefeasibility conditions

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Paths and cycles (05C38) Graph theory (05C99)

Cited in

(16)

• Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3
• Lower bounds for Ramsey numbers and association schemes
• The Paulus-Rozenfeld-Thompson graph on 26 vertices revisited and related combinatorial structures
• Second neighbourhoods of strongly regular graphs
• Distance-regular graphs having the \(M\)-property
• Distance regular covers of the complete graph
• Constructing the vertex-transitive graphs of order 24
• Distance-regular graphs with small number of distinct distance eigenvalues
• D-magic strongly regular graphs
• Extending generalized quadrangles
• Distance regular graphs of diameter 3 and strongly regular graphs
• Overlarge sets and partial geometries
• Covers of graphs and EGQs
• Boundary value problems on finite networks
• Distance-transitive graphs of valency 5, 6 and 7
• On almost nexus semi-symmetric designs

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)