Nonexistence of a class of distance-regular graphs (Q491527): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Yeh-Jong Pan / rank | |||
Property / author | |||
Property / author: Chih-Wen Weng / rank | |||
Revision as of 12:46, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nonexistence of a class of distance-regular graphs |
scientific article |
Statements
Nonexistence of a class of distance-regular graphs (English)
0 references
26 August 2015
0 references
Summary: Let \(\Gamma\) denote a distance-regular graph with diameter \(D \geqslant 3\) and intersection numbers \(a_1=0\), \(a_2 \neq 0\), and \(c_2=1\). We show a connection between the \(d\)-bounded property and the nonexistence of parallelograms of any length up to \(d+1\). Assume further that \(\Gamma\) is with classical parameters \((D, b, \alpha, \beta)\), \textit{Y.-J. Pan} and \textit{C.-W. Weng} [J. Comb. Theory, Ser. B 99, No. 1, 266--270 (2009; Zbl 1180.05127)] showed that \((b, \alpha, \beta)= (-2, -2, ((-2)^{D+1}-1)/3).\) Under the assumption \(D \geqslant 4\), we exclude this class of graphs by an application of the above connection.
0 references
distance-regular graph
0 references
classical parameters
0 references
parallelogram
0 references
strongly closed subgraph
0 references
\(D\)-bounded
0 references