The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\) (Q762177): 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.1016/0095-8956(84)90070-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026915525 / rank | |||
Normal rank | |||
Revision as of 00:35, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\) |
scientific article |
Statements
The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\) (English)
0 references
1984
0 references
The Johnson graph J(n,k) has the k-subsets of a fixed n-set as vertices, adjacent iff they differ in just one element. J(n,k) is distance regular, and it is shown that for \(n\geq 20\) the intersection array of J(n,k) determines the graph. In the meantime it has been proved by \textit{P. Terwilliger} [Discrete Math., to appear] and the reviewer [Characterization of a class of distance regular graphs, J. Reine Angew. Math. 357, 182-192 (1985)] that the intersection array of J(n,k) determines the graph iff (n,k)\(\neq (8,2)\).
0 references
Johnson scheme
0 references
distance regular graph
0 references
Johnson graph
0 references
