Spectral conditions for edge connectivity and packing spanning trees in multigraphs

DOI10.1016/J.LAA.2015.11.038MaRDI QIDQ905705zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs
• The second largest eigenvalue and vertex-connectivity of regular multigraphs
• Edge connectivity, packing spanning trees, and eigenvalues of graphs
• Note on edge-disjoint spanning trees and eigenvalues
• Edge-connectivity in regular multigraphs from eigenvalues

Cites work

• Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
• Edge-Disjoint Spanning Trees of Finite Graphs
• Edge-connectivity in regular multigraphs from eigenvalues
• Edge-connectivity, eigenvalues, and matchings in regular graphs
• Edge-disjoint spanning trees and eigenvalues
• Edge-disjoint spanning trees and eigenvalues of graphs
• Edge-disjoint spanning trees and eigenvalues of regular graphs
• Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
• Eigenvalues and edge-connectivity of regular graphs
• Graph theory
• Interlacing eigenvalues and graphs
• Note on edge-disjoint spanning trees and eigenvalues
• On the Problem of Decomposing a Graph into n Connected Factors
• Spectra of graphs

Cited in

(9)

• Edge connectivity, packing spanning trees, and eigenvalues of graphs
• Extremal graphs for a spectral inequality on edge-disjoint spanning trees
• Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs
• Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number
• Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
• Fractional spanning tree packing, forest covering and eigenvalues
• Graph rigidity properties of Ramanujan graphs
• The maximum number of spanning trees of a graph with given matching number

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905705)