Edge connectivity, packing spanning trees, and eigenvalues of graphs

DOI10.1080/03081087.2018.1529732zbMath1452.05101arXiv1704.05994OpenAlexW2964243625WikidataQ114641375 ScholiaQ114641375MaRDI QIDQ5134961

Xiangxiang Liu, Cunxiang Duan, Li-Gong Wang

Publication date: 18 November 2020

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

Full work available at URL: https://arxiv.org/abs/1704.05994

zbMATH Keywords

eigenvaluespanning tree packing numberedge connectivitysignless Laplacian eigenvaluequotient matrix

Mathematics Subject Classification ID

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

Related Items (max. 100)

Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph ⋮ Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs ⋮ On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the third largest eigenvalue of graphs
• 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
• Note on edge-disjoint spanning trees and eigenvalues
• Edge-disjoint spanning trees and eigenvalues of graphs
• Edge-disjoint spanning trees and eigenvalues
• 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

This page was built for publication: Edge connectivity, packing spanning trees, and eigenvalues of graphs