Pages that link to "Item:Q1072567"

The following pages link to The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\) (Q1072567):

Displaying 20 items.

• Isomorphism classes of association schemes induced by Hadamard matrices (Q499447) (← links)
• The subconstituent algebra of an association scheme. I (Q685996) (← links)
• The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\) (Q762177) (← links)
• Characters of finite quasigroups. VI: Critical examples and doubletons (Q916795) (← links)
• Root system graphs (Q1099192) (← links)
• A characterization of the association schemes of bilinear forms (Q1121921) (← links)
• Characterization of the folded Johnson graphs of small diameter by their intersection arrays (Q1372622) (← links)
• On distance-regular graphs with height two. II (Q1383815) (← links)
• 1-homogeneous graphs with cocktail party \({\mu}\)-graphs (Q1410769) (← links)
• Root systems and the Johnson and Hamming graphs (Q1820176) (← links)
• Distances and diameters on iterated clique graphs (Q1827868) (← links)
• On distance-regular graphs with height two (Q1906253) (← links)
• On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes (Q2023761) (← links)
• Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey (Q2042199) (← links)
• The edge-connectivity of token graphs (Q2045395) (← links)
• The connectivity of token graphs (Q2413643) (← links)
• Independence and matching numbers of some token graphs (Q5109075) (← links)
• On the Connectivity of Token Graphs of Trees (Q6045414) (← links)
• Using a Grassmann graph to recover the underlying projective geometry (Q6598011) (← links)
• A characterization of the Grassmann graphs (Q6661599) (← links)