A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph
From MaRDI portal
Publication:438889
DOI10.1007/s10623-011-9600-3zbMath1245.05037arXiv1109.2195OpenAlexW2023772766MaRDI QIDQ438889
Publication date: 31 July 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.2195
Related Items (5)
On bounding the diameter of a distance-regular graph ⋮ Inverse problems in the theory of distance-regular graphs ⋮ A note on distance-regular graphs with a small number of vertices compared to the valency ⋮ The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\) ⋮ On 2-walk-regular graphs with a large intersection number \(c_2\)
Cites Work
This page was built for publication: A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph