The following pages link to (Q3127430):
Displaying 27 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)
- Spectral properties of some structurally related graphs (Q1095931) (← 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)
- Spectral bisection of graphs and connectedness (Q2447954) (← 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)
- Investigating the connectivity of hypergraphs via their spectra (Q2714391) (← links)
- Statistical indicators useful in real spectrum location (Q2782306) (← links)
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs (Q2828824) (← links)
- Spectra, graph comparison (Q2853172) (← 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)
- Connected graphs cospectral with a friendship graph (Q5135785) (← links)
- Toughness and spectral radius in graphs (Q6611738) (← links)
- A unified combinatorial view beyond some spectral properties (Q6635841) (← links)
- \(l\)-connectivity, \(l\)-edge-connectivity and spectral radius of graphs (Q6639846) (← links)
