The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
type: Item
instance of: scholarly article
title: The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
zbMATH Open document ID: 0557.05049
DOI: 10.1016/0095-8956(84)90070-4
author: Aeryung Moon
published in: Journal of Combinatorial Theory. Series B
publication date: 1984-01-01T00:00:00Z
review text: 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)\).
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05B30
zbMATH DE Number: 3887737
zbMATH Keywords: Johnson scheme
zbMATH Keywords: distance regular graph
zbMATH Keywords: Johnson graph
MaRDI profile type: Publication
full work available at URL: 0095-8956(84)90070-4
OpenAlex ID: W2026915525
cites work: On the tetrahedral graph
cites work: A characterization problem in graph theory
cites work: Q3218140
cites work: Q4770409
cites work: A characterization of tetrahedral graphs
cites work: Q3262641
cites work: Q3941436
cites work: The Uniqueness of the Triangular Association Scheme
cites work: Q5707657
cites work: A characterization of the Tm graph
cites work: Characterization of H(n,q) by the parameters
cites work: On the Uniqueness of the Triangular Association Scheme
cites work: Q5579577
cites work: Orthogonal Polynomials, Duality and Association Schemes
cites work: On the uniqueness of the tetrahedral association schemes
cites work: Characterization of the odd graphs \(O_ k \)by parameters
cites work: Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k)
cites work: On the uniqueness of the graphs G(n,k) of the Johnson schemes
cites work: Q5543324
cites work: On a Characterization of the Triangular Association Scheme
description: scientific article; zbMATH DE number 3887737