Distance-Regular Graphs with Diameter Three
From MaRDI portal
Publication:4742829
DOI10.1016/S0304-0208(08)73254-7zbMath0506.05057OpenAlexW108413068MaRDI QIDQ4742829
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
Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99)
Related Items (16)
Lower bounds for Ramsey numbers and association schemes ⋮ On almost nexus semi-symmetric designs ⋮ Boundary Value Problems on Finite Networks ⋮ Extending generalized quadrangles ⋮ Distance-regular graphs with small number of distinct distance eigenvalues ⋮ Overlarge sets and partial geometries ⋮ Constructing the vertex-transitive graphs of order 24 ⋮ The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures ⋮ Covers of graphs and EGQs ⋮ Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3 ⋮ Second neighbourhoods of strongly regular graphs ⋮ Distance-transitive graphs of valency 5, 6 and 7 ⋮ Distance regular covers of the complete graph ⋮ D-magic strongly regular graphs ⋮ Distance regular graphs of diameter 3 and strongly regular graphs ⋮ Distance–regular graphs having theM-property
This page was built for publication: Distance-Regular Graphs with Diameter Three
