The graphs G(n,k) of the Johnson schemes are unique for n 20
The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
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)\).
- A characterization of tetrahedral graphs
- A characterization of the Tm graph
- A characterization problem in graph theory
- Characterization of H(n,q) by the parameters
- Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k)
- Characterization of the odd graphs \(O_ k \)by parameters
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3145665 (Why is no real title available?)
- scientific article; zbMATH DE number 3758369 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 3258082 (Why is no real title available?)
- scientific article; zbMATH DE number 3296351 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- On a Characterization of the Triangular Association Scheme
- On the tetrahedral graph
- On the uniqueness of the graphs G(n,k) of the Johnson schemes
- On the uniqueness of the tetrahedral association schemes
- On the Uniqueness of the Triangular Association Scheme
- Orthogonal Polynomials, Duality and Association Schemes
- The Uniqueness of the Triangular Association Scheme
- Hamiltonian uniform subset graphs
- The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
- A local characterization of the Johnson scheme
- Covering projections of graphs preserving links of vertices and edges
- Characterization of the folded Johnson graphs of small diameter by their intersection arrays
- Cospectral mates for the union of some classes in the Johnson association scheme
- Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
- A classification of the strongly regular generalised Johnson graphs
- Resolving sets for Johnson and Kneser graphs
- On the girth and diameter of generalized Johnson graphs
- The graph \(\Delta_{2n - 1}\) is an induced subgraph of a Johnson graph
- Smallest generalized cuts and diameter-increasing sets of Johnson graphs.
- scientific article; zbMATH DE number 4099352 (Why is no real title available?)
- scientific article; zbMATH DE number 1439479 (Why is no real title available?)
- Binary codes and partial permutation decoding sets from the Johnson graphs
- An infinite family of incidence geometries whose incidence graphs are locally \(X^\ast\)
- Asymptotically sharpening the s-Hamiltonian index bound
- Nonuniform subset graphs associated with any graph
This page was built for publication: The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762177)
