A new family of distance-regular graphs with unbounded diameter
By E. V. Dam, J. Koolen. 2005
86 citations recorded by the source corpus.
We construct distance-regular graphs with the same – classical – parameters as the Grassmann graphs on the e-dimensional subspaces of a (2e+1)-dimensional space over an arbitrary finite field. This provides the first known family of non-vertex-transitive distance-regular graphs with unbounded diameter.
Subfields: Artificial Intelligence, Discrete Mathematics and Combinatorics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/00dcba60e857557c8545a8d6ed28e03be8589d99
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Discrete Mathematics and Combinatorics
In Geometry and Topology
- Andries E. Brouwer
- Willem H. Haemers
- Sebastian M. Cioaba
- Dragos M. Cvetkovic
- David A. Gregory
- Slobodan K. Simic
Citations in the corpus
- Spectra of Graphs (2011, background): “Van Dam & Koolen [141] construct distance-regular graphs vDK(m) with the same parameters as Gr(2m + 1,m).”