Spectral conditions for edge connectivity and packing spanning trees in multigraphs

DOI10.1016/j.laa.2015.11.038zbMath1329.05189OpenAlexW2200264387MaRDI QIDQ905705

Xiaofeng Gu

Publication date: 28 January 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2015.11.038

zbMATH Keywords

eigenvaluespanning treealgebraic connectivityedge connectivityballoon

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (9)

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 ⋮ Graph rigidity properties of Ramanujan graphs ⋮ Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs ⋮ Edge connectivity, packing spanning trees, and eigenvalues of graphs ⋮ Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number ⋮ The maximum number of spanning trees of a graph with given matching number ⋮ Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs

Cites Work

• Edge-disjoint spanning trees and eigenvalues of regular graphs
• Spectra of graphs
• Eigenvalues and edge-connectivity of regular graphs
• Interlacing eigenvalues and graphs
• Note on edge-disjoint spanning trees and eigenvalues
• Edge-disjoint spanning trees and eigenvalues of graphs
• Edge-disjoint spanning trees and eigenvalues
• Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
• Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
• 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
• Edge-connectivity in regular multigraphs from eigenvalues
• Unnamed Item

This page was built for publication: Spectral conditions for edge connectivity and packing spanning trees in multigraphs