Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs

DOI10.1002/jgt.21857zbMath1409.05120OpenAlexW1521019410MaRDI QIDQ3466350

Xiaofeng Gu, Hong-Jian Lai, Senmei Yao, Ping Li

Publication date: 1 February 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21857

zbMATH Keywords

eigenvalueadjacency matrixLaplacian matrixsignless Laplacian matrixedge-disjoint spanning treesedge connectivityquotient matrixspanning-tree packing number

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Related Items (26)

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 radius conditions for the rigidity of graphs ⋮ Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity ⋮ Spectral radius and edge‐disjoint spanning trees ⋮ Graph rigidity properties of Ramanujan graphs ⋮ Sharp spectral bounds for the vertex-connectivity of regular 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-disjoint spanning trees and eigenvalues of graphs ⋮ Edge-disjoint spanning trees and eigenvalues ⋮ 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 ⋮ Spectral radius and \(k\)-connectedness of a graph ⋮ Note on edge-disjoint spanning trees and eigenvalues ⋮ Spectral conditions for some graphical properties ⋮ 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 ⋮ Fractional matching number and eigenvalues of a graph ⋮ The maximum spectral radius of non-bipartite graphs forbidding short odd cycles

Cites Work

• Edge-disjoint spanning trees and eigenvalues of regular graphs
• Spectra of graphs
• Eigenvalues and edge-connectivity of regular graphs
• 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
• On the spanning tree packing number of a graph: A survey

This page was built for publication: Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs