Edge-disjoint spanning trees and eigenvalues of regular graphs

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

zbMATH Keywords

eigenvalue; connectivity; toughness; edge-toughness; edge-disjoint spanning trees

Mathematics Subject Classification ID

05C05: Trees

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C40: Connectivity

Related Items

Spectral conditions for graphs to be β-deficient involving minimum degree, Fractional spanning tree packing, forest covering and eigenvalues, Spectral conditions for edge connectivity and packing spanning trees in multigraphs, Note on edge-disjoint spanning trees and eigenvalues, Edge-disjoint spanning trees and eigenvalues of graphs, Edge-disjoint spanning trees and eigenvalues, 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