Edge-disjoint spanning trees and eigenvalues
From MaRDI portal
Publication:2442253
DOI10.1016/j.laa.2013.11.039zbMath1297.05149OpenAlexW2115683609MaRDI QIDQ2442253
Qinghai Liu, Yanmei Hong, Hong-Jian Lai
Publication date: 2 April 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2013.11.039
Related Items (18)
Fractional matching number and spectral radius of nonnegative matrices of graphs ⋮ Fractional spanning tree packing, forest covering and eigenvalues ⋮ Extremal graphs for a spectral inequality on edge-disjoint spanning trees ⋮ Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph ⋮ Graph rigidity properties of Ramanujan graphs ⋮ Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs ⋮ Spectral conditions for edge connectivity and packing spanning trees in multigraphs ⋮ Edge connectivity, packing spanning trees, and eigenvalues of graphs ⋮ 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 ⋮ On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\) ⋮ Note on edge-disjoint spanning trees and eigenvalues ⋮ Vertex-connectivity and eigenvalues of graphs with fixed girth ⋮ Vertex-connectivity and eigenvalues of graphs ⋮ Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs ⋮ Spanning tree packing number and eigenvalues of graphs with given girth ⋮ Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
Cites Work
- Unnamed Item
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- Spectra of graphs
- Edge-connectivity and edge-disjoint spanning trees
- Eigenvalues and edge-connectivity of regular graphs
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Connectivity and edge-disjoint spanning trees
- Interlacing eigenvalues and graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
- On the spanning tree packing number of a graph: A survey
This page was built for publication: Edge-disjoint spanning trees and eigenvalues