Edge-disjoint spanning trees and eigenvalues of graphs
From MaRDI portal
Publication:2435485
DOI10.1016/j.laa.2013.08.041zbMath1282.05128OpenAlexW2039794704MaRDI QIDQ2435485
Publication date: 19 February 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.08.041
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)
Related Items
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, 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, 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
Cites Work
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- Spectra of graphs
- Eigenvalues and edge-connectivity of regular 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
