Algebraic conditions for t-tough graphs

DOI10.1007/S10587-010-0073-8zbMath1224.05307OpenAlexW1985974343MaRDI QIDQ3073536

Siyuan Chen, Bo Lian Liu

Publication date: 11 February 2011

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/196588

zbMATH Keywords

eigenvalueLaplacian matrixadjacent matrix\(t\)-tough graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Structural characterization of families of graphs (05C75)

Related Items (6)

Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph ⋮ The spectrum and toughness of regular graphs ⋮ Sharp spectral bounds for the vertex-connectivity of regular graphs ⋮ Graph toughness from Laplacian eigenvalues ⋮ On the Laplacian spectral ratio of connected graphs ⋮ Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs

Cites Work

• A domain monotonicity theorem for graphs and Hamiltonicity
• Eigenvalues and perfect matchings
• Toughness and spectrum of a graph
• Interlacing eigenvalues and graphs
• Tough graphs and Hamiltonian circuits. (Reprint)
• Toughness and the existence ofk-factors

This page was built for publication: Algebraic conditions for t-tough graphs