Distance-regular graph with the intersection array {45, 30, 7; 1, 2, 27} does not exist

DOI10.1515/dma-2013-016zbMath1311.05050OpenAlexW2318681287MaRDI QIDQ5249785

Alexander L. Gavrilyuk, Aleksandr Alekseevich Makhnev

Publication date: 12 May 2015

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2013-016

zbMATH Keywords

geometric distance-regular graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Diameter bounds for geometric distance-regular graphs ⋮ Inverse problems in the theory of distance-regular graphs ⋮ Geometric distance-regular graphs without 4-claws ⋮ The Koolen-Park boundary and distance-regular graphs without \(m\)-claws ⋮ Distance-regular graphs with intersection arrays \(\{52, 35, 16; 1, 4, 28\}\) and \(\{69, 48, 24; 1, 4, 46\}\) do not exist ⋮ On geometric distance-regular graphs with diameter three ⋮ Distance-regular graphs without 4-claws