Pages that link to "Item:Q1123214"

The following pages link to On distance-regular graphs with fixed valency. III (Q1123214):

Displaying 11 items.

• There are only finitely many distance-regular graphs of fixed valency greater than two (Q475256) (← links)
• Bounding the diameter of a distance regular graph by a function of \(k_ d\) (Q1180676) (← links)
• The distance-regular graphs of valency four (Q1296385) (← links)
• A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph (Q1413223) (← links)
• Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I (Q1825881) (← links)
• There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10 (Q1826924) (← links)
• On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7 (Q1864611) (← links)
• On distance-regular graphs with \(k_ i= k_ j\). II (Q1906855) (← links)
• Two theorems concerning the Bannai-Ito conjecture (Q2643848) (← links)
• There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency (Q3645154) (← links)
• On the Calculation of Multiplicities for<i>P</i>-Polynomial<i>C</i>-Algebras (Q5412020) (← links)