Pages that link to "Item:Q1668071"

The following pages link to Distance-regular Shilla graphs with \(b_2 = c_2\) (Q1668071):

Displaying 15 items.

• Automorphisms of a graph with intersection array \(\{nm - 1, nm - n + m - 1, n - m + 1;1, 1, nm - n + m - 1\}\) (Q828118) (← links)
• Inverse problems of graph theory: generalized quadrangles (Q1669960) (← links)
• Inverse problems in the theory of distance-regular graphs: dual 2-designs (Q2043617) (← links)
• Inverse problems in the class of distance-regular graphs of diameter 4 (Q2095491) (← links)
• Distance-regular graphs of diameter 3 without triangles with \(c_2=2\) (Q2100140) (← links)
• Shilla distance-regular graphs with \(b_2 = sc_2\) (Q2185639) (← links)
• Inverse problems in the theory of distance-regular graphs (Q2185643) (← links)
• The largest Moore graph and a distance-regular graph with intersection array \(\{55, 54, 2; 1, 1, 54\}\) (Q2213942) (← links)
• Inverse problems of graph theory: graphs without triangles (Q2227043) (← links)
• Three infinite families of Shilla graphs do not exist (Q2243870) (← links)
• Codes in Shilla distance-regular graphs (Q2284194) (← links)
• Inverse problems in graph theory: nets (Q2417996) (← links)
• DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {27, 20, 7; 1, 4, 21} DOES NOT EXIST (Q4986291) (← links)
• ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE \(\theta=1\) (Q5884742) (← links)
• On small distance-regular graphs with the intersection arrays \( \{mn - 1, (m - 1)(n + 1), n - m + 1; 1, 1, (m - 1)(n + 1)\}\) (Q6089440) (← links)