Pages that link to "Item:Q2828824"
From MaRDI portal
The following pages link to Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs (Q2828824):
Displayed 21 items.
- Spectral conditions for some graphical properties (Q526290) (← links)
- Spectral radius and \(k\)-connectedness of a graph (Q1744085) (← links)
- Spectral conditions for graph rigidity in the Euclidean plane (Q2043397) (← links)
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues (Q2066004) (← links)
- \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs (Q2091163) (← 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)
- Spectral conditions for graphs to be β-deficient involving minimum degree (Q4640095) (← links)
- Spectral Bounds for the Connectivity of Regular Graphs with Given Order (Q4685895) (← links)
- Thin trees in some families of distance-regular graphs (Q4965921) (← links)
- A Proof of Brouwer's Toughness Conjecture (Q4990394) (← links)
- The spanning <i>k</i>-trees, perfect matchings and spectral radius of graphs (Q5888899) (← links)
- Eigenvalues and [a,b]‐factors in regular graphs (Q6081550) (← links)
- ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs (Q6081885) (← links)
- Spectral bounds for the vulnerability parameters of graphs (Q6125428) (← links)
- Graph rigidity properties of Ramanujan graphs (Q6133153) (← links)