Pages that link to "Item:Q1836676"
From MaRDI portal
The following pages link to Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k) (Q1836676):
Displaying 5 items.
- The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\) (Q762177) (← links)
- The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\) (Q1072567) (← links)
- A survey of some problems in combinatorial designs - a matrix approach (Q1076673) (← links)
- Root systems and the Johnson and Hamming graphs (Q1820176) (← links)
- On the uniqueness of the graphs G(n,k) of the Johnson schemes (Q1836677) (← links)
