On the uniqueness of the graphs G(n,k) of the Johnson schemes

DOI10.1016/0095-8956(82)90045-4zbMath0506.05054OpenAlexW1995620505MaRDI QIDQ1836677

Aeryung Moon

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

zbMATH Keywords

distance regular graphassociation scheme of class dgraph of Johnson scheme

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other designs, configurations (05B30) Structural characterization of families of graphs (05C75)

Related Items

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), Root systems and the Johnson and Hamming graphs, The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\), Some properties of a class of interchange graphs, The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)

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