Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph

DOI10.1007/s41980-020-00375-9zbMath1456.05101OpenAlexW3012942450MaRDI QIDQ2657863

Li-Gong Wang, Cunxiang Duan

Publication date: 15 March 2021

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41980-020-00375-9

zbMATH Keywords

eigenvalueconnectivitytoughnessspanning \(k\)-tree

Mathematics Subject Classification ID

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

Related Items (3)

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\) ⋮ \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The spectrum and toughness of regular graphs
• Edge-disjoint spanning trees and eigenvalues of regular graphs
• Spectra of graphs
• Spectral conditions for edge connectivity and packing spanning trees in multigraphs
• On a connection between the existence of k-trees and the toughness of a graph
• Tough Ramsey graphs without short cycles
• Toughness and spectrum of a graph
• Note on edge-disjoint spanning trees and eigenvalues
• Edge-disjoint spanning trees and eigenvalues of graphs
• Edge-disjoint spanning trees and eigenvalues
• Toughness in graphs -- a survey
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
• Algebraic conditions for t-tough graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
• Toughness, trees, and walks
• Edge connectivity, packing spanning trees, and eigenvalues of graphs

This page was built for publication: Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph