Pages that link to "Item:Q602713"

The following pages link to On distance-regular graphs with smallest eigenvalue at least \(- m\) (Q602713):

Displaying 19 items.

• Completely regular clique graphs. II (Q256544) (← links)
• Asymptotic Delsarte cliques in distance-regular graphs (Q295820) (← links)
• Completely regular clique graphs (Q402941) (← links)
• Distance-regular graphs of large diameter that are completely regular clique graphs (Q1631384) (← links)
• A valency bound for distance-regular graphs (Q1689048) (← links)
• A new characterization of the dual polar graphs (Q1719579) (← links)
• Coverings and homotopy of a graph (Q1752673) (← links)
• Geometric distance-regular graphs without 4-claws (Q1932578) (← links)
• A characterization of Johnson and Hamming graphs and proof of Babai's conjecture (Q1984524) (← links)
• On the spectral gap and the automorphism group of distance-regular graphs (Q2033919) (← links)
• Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey (Q2042199) (← links)
• Geometric antipodal distance-regular graphs with a given smallest eigenvalue (Q2287732) (← links)
• There does not exist a distance-regular graph with intersection array \(\{80, 54,12; 1, 6, 60\}\) (Q2287750) (← links)
• Distance-regular graphs without 4-claws (Q2311358) (← links)
• Diameter bounds for geometric distance-regular graphs (Q2411625) (← links)
• Geometric aspects of 2-walk-regular graphs (Q2435427) (← links)
• On geometric distance-regular graphs with diameter three (Q2441641) (← links)
• A note on distance-regular graphs with a small number of vertices compared to the valency (Q2444727) (← links)
• Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions (Q6171759) (← links)