Pages that link to "Item:Q2174419"

The following pages link to Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\) (Q2174419):

Displaying 16 items.

• Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\) (Q405062) (← links)
• A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph (Q438889) (← links)
• The local eigenvalues of a bipartite distance-regular graph (Q482129) (← links)
• On bipartite distance-regular graphs with a strongly closed subgraph of diameter three (Q607010) (← links)
• Second neighbourhoods of strongly regular graphs (Q1197051) (← links)
• The distance-regular graphs with intersection number \(a_1\neq 0\) and with an eigenvalue \(-1-(b_1/2)\) (Q1280306) (← links)
• Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\) (Q1898055) (← links)
• The 2-partially distance-regular graphs such that their second largest local eigenvalues are at most one (Q2065922) (← links)
• A characterization of graphs with regular distance-2 graphs (Q2097182) (← links)
• Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue (Q2117517) (← links)
• On bounding the diameter of a distance-regular graph (Q2151185) (← links)
• Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible (Q2283214) (← links)
• Distance-regular graphs of diameter 3 having eigenvalue \(-1\) (Q2402439) (← links)
• Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3 (Q2462330) (← links)
• ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE \(\theta=1\) (Q5884742) (← links)
• Invariants for incidence matrix of a tree (Q6639850) (← links)