The following pages link to On the tetrahedral graph (Q2527467):
Displaying 6 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)
- Characterization of the odd graphs \(O_ k \)by parameters (Q1168984) (← links)
- Root systems and the Johnson and Hamming graphs (Q1820176) (← links)
- Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k) (Q1836676) (← links)
- On the uniqueness of the graphs G(n,k) of the Johnson schemes (Q1836677) (← links)
