Edge-disjoint spanning trees and eigenvalues of regular graphs
From MaRDI portal
Publication:426054
DOI10.1016/j.laa.2012.03.013zbMath1242.05056arXiv1312.2245MaRDI QIDQ426054
Sebastian M. Cioabă, Wiseley Wong
Publication date: 11 June 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.2245
Related Items
Spectral conditions for graphs to be β-deficient involving minimum degree, Edge connectivity, packing spanning trees, and eigenvalues of graphs, Spectral radius and edge‐disjoint spanning trees, Graph rigidity properties of Ramanujan graphs, Fractional spanning tree packing, forest covering and eigenvalues, Spectral conditions for edge connectivity and packing spanning trees in multigraphs, Vertex-connectivity and eigenvalues of graphs with fixed girth, Spectral conditions for graph rigidity in the Euclidean plane, Extremal graphs for a spectral inequality on edge-disjoint spanning trees, Toughness in pseudo-random graphs, Connectivity and eigenvalues of graphs with given girth or clique number, Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number, Note on edge-disjoint spanning trees and eigenvalues, Vertex-connectivity and eigenvalues of graphs, Spanning tree packing number and eigenvalues of graphs with given girth, Edge-disjoint spanning trees and eigenvalues of graphs, Edge-disjoint spanning trees and eigenvalues, Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph, Sharp spectral bounds for the vertex-connectivity of regular graphs, Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs, Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs, Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- A short proof of the tree-packing theorem
- Spectra of graphs
- Spanning trees: A survey
- On the higher-order edge toughness of a graph
- Edge-connectivity and edge-disjoint spanning trees
- Eigenvalues and edge-connectivity of regular graphs
- Bounds of the number of disjoint spanning trees
- Tough Ramsey graphs without short cycles
- Toughness and spectrum of a graph
- Interlacing eigenvalues and graphs
- Embedding Spanning Trees in Random Graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Matrix Analysis
- Optimal attack and reinforcement of a network
- On the spanning tree packing number of a graph: A survey