Algebraic conditions for t-tough graphs

DOI10.1007/S10587-010-0073-8zbMATH Open1224.05307OpenAlexW1985974343MaRDI QIDQ3073536FDOQ3073536

Authors: Siyuan Chen, Bolian 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

Laplacian matrixeigenvalueadjacent 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)

Cites Work

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

Cited In (9)

• The spectrum and toughness of regular graphs
• Vertex cut, eigenvalues, \([a,b]\)-factors and toughness of connected bipartite graphs
• Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph
• 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.
• Toughness and distance spectral radius in graphs involving minimum degree
• Sharp spectral bounds for the vertex-connectivity of regular graphs
• Properties of minimally \(t\)-tough graphs

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

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