Pages that link to "Item:Q2100140"

The following pages link to Distance-regular graphs of diameter 3 without triangles with \(c_2=2\) (Q2100140):

Displaying 8 items.

• A circuit chasing technique in a distance-regular graph with triangles (Q1322409) (← links)
• Three new distance-regular graphs (Q1322415) (← links)
• There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10 (Q1826924) (← links)
• On distance-regular graphs with \(c_2 = 2\) (Q2064382) (← links)
• On distance-regular graph \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\) (Q2285185) (← links)
• On geometric distance-regular graphs with diameter three (Q2441641) (← links)
• Triangle-free distance-regular graphs (Q2467552) (← links)
• A note on triangle-free distance-regular graphs with \(a_2\neq 0\) (Q2519028) (← links)