The following pages link to (Q3127430):
Displaying 18 items.
- On the connectedness of the complement of a ball in distance-regular graphs (Q356734) (← links)
- The spectrum and toughness of regular graphs (Q403562) (← links)
- Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
- On a conjecture of Brouwer involving the connectivity of strongly regular graphs (Q765871) (← links)
- Eigenvalues and edge-connectivity of regular graphs (Q1044623) (← links)
- On the connectivity of graphs in association schemes (Q1691090) (← links)
- Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph (Q2005196) (← links)
- The toughness of Kneser graphs (Q2037560) (← links)
- Toughness and normalized Laplacian eigenvalues of graphs (Q2139788) (← links)
- Toughness in pseudo-random graphs (Q2225447) (← links)
- Disconnecting strongly regular graphs (Q2637232) (← links)
- Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph (Q2657863) (← links)
- Graph toughness from Laplacian eigenvalues (Q2700326) (← links)
- Toughness, Hamiltonicity and spectral radius in graphs (Q2701002) (← links)
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs (Q2828824) (← links)
- A Proof of Brouwer's Toughness Conjecture (Q4990394) (← links)
- The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs (Q5028356) (← links)
- The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs (Q5092407) (← links)
