Distance-regular graphs with \(c_i=b_{d-i}\) and antipodal double covers (Q1272893)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1228564
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distance-regular graphs with \(c_i=b_{d-i}\) and antipodal double covers |
scientific article; zbMATH DE number 1228564 |
Statements
Distance-regular graphs with \(c_i=b_{d-i}\) and antipodal double covers (English)
0 references
13 March 2000
0 references
The main result of this paper is the following theorem: Let \(\Gamma\) be a distance-regular graph of diameter \(d\) and valency \(k>2\). Suppose there exists an integer \(s\) with \(d\leq 2s\) such that \(c_i=b_{d-i}\) for all \(1\leq i\leq s\). Then \(\Gamma\) is an antipodal double cover.
0 references
distance-regular graph
0 references
antipodal double cover
0 references
0.9021776914596558
0 references
0.8652055859565735
0 references
