Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k)

DOI10.1016/0095-8956(82)90040-5zbMath0506.05053OpenAlexW1997036024MaRDI QIDQ1836676

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)90040-5

zbMATH Keywords

distance regular graphgraph 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

A survey of some problems in combinatorial designs - a matrix approach ⋮ Root systems and the Johnson and Hamming graphs ⋮ The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\) ⋮ On the uniqueness of the graphs G(n,k) of the Johnson schemes ⋮ The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Characterization of the odd graphs \(O_ k \)by parameters
• On the uniqueness of the tetrahedral association schemes
• On the tetrahedral graph
• On a Characterization of the Triangular Association Scheme
• A characterization of tetrahedral graphs
• A characterization problem in graph theory