Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph
From MaRDI portal
(Redirected from Publication:2657863)
Recommendations
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- -connectivity, integrity, tenacity, toughness and eigenvalues of graphs
- Graph toughness from Laplacian eigenvalues
- Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs
- Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
Cites work
- scientific article; zbMATH DE number 997668 (Why is no real title available?)
- Algebraic conditions for t-tough graphs
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- Edge connectivity, packing spanning trees, and eigenvalues of graphs
- Edge-Disjoint Spanning Trees of Finite Graphs
- Edge-disjoint spanning trees and eigenvalues
- Edge-disjoint spanning trees and eigenvalues of graphs
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
- Graph theory
- Note on edge-disjoint spanning trees and eigenvalues
- On a connection between the existence of k-trees and the toughness of a graph
- Spectra of graphs
- Spectral conditions for edge connectivity and packing spanning trees in multigraphs
- The spectrum and toughness of regular graphs
- Tough Ramsey graphs without short cycles
- Toughness and spectrum of a graph
- Toughness in graphs -- a survey
- Toughness, trees, and walks
Cited in
(8)- Vertex cut, eigenvalues, \([a,b]\)-factors and toughness of connected bipartite graphs
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)
- The vertex connectivity and the third largest eigenvalue in regular (multi-)graphs
- Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs
- scientific article; zbMATH DE number 6770102 (Why is no real title available?)
- -connectivity, integrity, tenacity, toughness and eigenvalues of graphs
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
This page was built for publication: Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657863)