Distance-regular graphs the distance matrix of which has only one positive eigenvalue (Q1329077): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/eujc.1994.1030 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994300999 / rank | |||
Normal rank | |||
Latest revision as of 02:53, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Distance-regular graphs the distance matrix of which has only one positive eigenvalue |
scientific article |
Statements
Distance-regular graphs the distance matrix of which has only one positive eigenvalue (English)
0 references
19 July 1994
0 references
``In this paper we investigate the metric hierarchy for distance-regular graphs; in particular, we classify the graphs in the title''.
0 references
distance matrix
0 references
positive eigenvalue
0 references
metric hierarchy
0 references
distance-regular graphs
0 references
