On the uniqueness of the graphs G(n,k) of the Johnson schemes
From MaRDI portal
Publication:1836677
DOI10.1016/0095-8956(82)90045-4zbMath0506.05054MaRDI QIDQ1836677
Publication date: 1982
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(82)90045-4
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05B30: Other designs, configurations
05C75: Structural characterization of families of graphs
Related Items
The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\), The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\), Distance-transitive representations of the symmetric groups, A characterization of the association schemes of bilinear forms, Galois correspondence between permutation groups and cellular rings (association schemes), Some properties of a class of interchange graphs, Root systems and the Johnson and Hamming graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterization of the odd graphs \(O_ k \)by parameters
- On the uniqueness of the tetrahedral association schemes
- Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k)
- On the tetrahedral graph
- The Uniqueness of the Triangular Association Scheme
- On a Characterization of the Triangular Association Scheme
- On the Uniqueness of the Triangular Association Scheme
- A characterization of tetrahedral graphs
- A characterization problem in graph theory
- A characterization of the Tm graph