Pages that link to "Item:Q403562"
From MaRDI portal
The following pages link to The spectrum and toughness of regular graphs (Q403562):
Displaying 14 items.
- The toughness of Kneser graphs (Q2037560) (← links)
- Toughness and normalized Laplacian eigenvalues of graphs (Q2139788) (← links)
- Toughness in pseudo-random graphs (Q2225447) (← links)
- Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph (Q2657863) (← links)
- Sharp spectral bounds for the vertex-connectivity of regular graphs (Q2687918) (← links)
- Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs (Q2699581) (← 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)
- Vertex cut, eigenvalues, \([a,b]\)-factors and toughness of connected bipartite graphs (Q6570042) (← 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)
