Pages that link to "Item:Q1168984"

The following pages link to Characterization of the odd graphs \(O_ k \)by parameters (Q1168984):

Displaying 15 items.

• 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)
• Linear programming bounds for regular graphs (Q897255) (← 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)
• P and Q polynomial schemes with \(q=-1\) (Q1121894) (← links)
• On uniformly geodetic graphs (Q1313350) (← links)
• Spectral characterization of odd graphs \(O_ k, k\leq 6\) (Q1340122) (← links)
• The Terwilliger algebra of an almost-bipartite \(P\)- and \(Q\)-polynomial association scheme (Q1773354) (← links)
• Spectral bounds and distance-regularity (Q1774959) (← 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)
• Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue (Q2818201) (← links)
• Distance-transitive graphs of valency 5, 6 and 7 (Q5903316) (← links)