Pages that link to "Item:Q1411113"
From MaRDI portal
The following pages link to The number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph (Q1411113):
Displaying 4 items.
- A circuit chasing technique in a distance-regular graph with triangles (Q1322409) (← links)
- An improvement of the Boshier-Nomura bound (Q1328378) (← links)
- A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph (Q1413223) (← links)
- A constant bound on the number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph (Q1911238) (← links)
