Pages that link to "Item:Q1836677"

The following pages link to On the uniqueness of the graphs G(n,k) of the Johnson schemes (Q1836677):

Displaying 7 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)
• Distance-transitive representations of the symmetric groups (Q1084111) (← links)
• A characterization of the association schemes of bilinear forms (Q1121921) (← links)
• Galois correspondence between permutation groups and cellular rings (association schemes) (Q1174111) (← links)
• Some properties of a class of interchange graphs (Q1288225) (← links)
• Root systems and the Johnson and Hamming graphs (Q1820176) (← links)