Edge-disjoint spanning trees and eigenvalues of regular graphs

DOI10.1016/J.LAA.2012.03.013zbMath1242.05056arXiv1312.2245OpenAlexW2962940504MaRDI 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

eigenvalueconnectivitytoughnessedge-toughnessedge-disjoint spanning trees

Mathematics Subject Classification ID

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

Related Items (22)

Fractional spanning tree packing, forest covering and eigenvalues ⋮ Extremal graphs for a spectral inequality on edge-disjoint spanning trees ⋮ Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in 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 ⋮ 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 conditions for graphs to be β-deficient involving minimum degree ⋮ Note on edge-disjoint spanning trees and eigenvalues ⋮ 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

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

This page was built for publication: Edge-disjoint spanning trees and eigenvalues of regular graphs