Note on edge-disjoint spanning trees and eigenvalues

DOI10.1016/j.laa.2014.05.044zbMath1295.05146OpenAlexW2079208696MaRDI QIDQ2250921

Hong-Jian Lai, Qinghai Liu, Xiaofeng Gu, Yanmei Hong

Publication date: 22 July 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.2014.05.044

zbMATH Keywords

eigenvaluealgebraic connectivityedge-disjoint spanning treesquotient matrix

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)

Related Items (24)

Fractional matching number and spectral radius of nonnegative matrices of graphs ⋮ The general spectral radii of (multicone-)graphs with prescribed degree sequence ⋮ Lattices over Bass rings and graph agglomerations ⋮ Fractional spanning tree packing, forest covering and eigenvalues ⋮ Extremal graphs for a spectral inequality on edge-disjoint spanning trees ⋮ Strengthened Ore conditions for \((s, t)\)-supereulerian graphs ⋮ Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph ⋮ Spectral radius and edge‐disjoint spanning trees ⋮ 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 ⋮ On \(( s , t )\)-supereulerian graphs with linear degree bounds ⋮ 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 ⋮ Vertex-connectivity and eigenvalues of graphs with fixed girth ⋮ Vertex-connectivity and eigenvalues of graphs ⋮ Spectral conditions for graph rigidity in the Euclidean plane ⋮ 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 ⋮ Complete family reduction and spanning connectivity in line graphs ⋮ Spectral and extremal conditions for supereulerian graphs

Cites Work

• Unnamed Item
• Edge-disjoint spanning trees and eigenvalues of regular graphs
• Spectra of graphs
• Eigenvalues and edge-connectivity of regular graphs
• Interlacing eigenvalues and graphs
• Edge-disjoint spanning trees and eigenvalues of graphs
• Edge-disjoint spanning trees and eigenvalues
• 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: Note on edge-disjoint spanning trees and eigenvalues