On distance-regular graphs with smallest eigenvalue at least \(- m\) (Q602713): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Sejeong Bang / rank | |||
Property / reviewed by | |||
Property / reviewed by: G. Narasimha-Shenoi Prasanth / rank | |||
Revision as of 09:02, 14 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On distance-regular graphs with smallest eigenvalue at least \(- m\) |
scientific article |
Statements
On distance-regular graphs with smallest eigenvalue at least \(- m\) (English)
0 references
5 November 2010
0 references
The whole paper is divided into seven sections. First section reviews the literature. Section~2 deals with basic definitions needed in the sequel. The third section presents some useful results. Section~4 discusses some useful properties of geometric distance regular graphs. In the fifth section, distances regular graphs that are geometric are discussed and the author proves the theorem ``For integers \(m\geq 2\) and \(D\geq 2\), there are only finitely many coconnected non-geometries distance-regular graphs with smallest eignvalue at least \(-m\) and diameter \(D\)''. The distance-regular Terwilliger graphs with fixed smallest eigenvalue and the intersection number \(c_2\) is studied in section \(6\). This section also discusses the theorem, ``For \(m \geq 2\), there are only finitely many coconnected non-geometric, distance regular graphs with smallest eigenvalue \(-m\), and intersection number \(c_2\)''. In the last section, geometric distance-regular graphs are discussed in detail and three conjectures are posed.
0 references
geometric distance-regular graph
0 references
smallest eigenvalue
0 references
geometric strongly regular graph, partial linear space
0 references