Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs

DOI10.1016/j.laa.2023.01.022OpenAlexW4318682208MaRDI QIDQ2689159

Yang Hu, Li-Gong Wang, Cunxiang Duan

Publication date: 9 March 2023

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

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

zbMATH Keywords

multigrapheigenvaluespanning tree packing numberedge connectivityquotient matrix

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• On the third largest eigenvalue of graphs
• A short proof of the tree-packing theorem
• Edge-disjoint spanning trees and eigenvalues of regular graphs
• Spectra of graphs
• Spectral conditions for edge connectivity and packing spanning trees in multigraphs
• Eigenvalues and edge-connectivity of regular graphs
• On the third largest eigenvalue of a graph
• Interlacing eigenvalues and graphs
• Connectivity and eigenvalues of graphs with given girth or clique number
• Note on edge-disjoint spanning trees and eigenvalues
• Spanning tree packing number and eigenvalues of graphs with given girth
• Edge-disjoint spanning trees and eigenvalues of graphs
• Edge-disjoint spanning trees and eigenvalues
• Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph
• 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, packing spanning trees, and eigenvalues of graphs

This page was built for publication: Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs