Algebraic conditions for t-tough graphs
From MaRDI portal
Publication:3073536
DOI10.1007/s10587-010-0073-8zbMath1224.05307MaRDI QIDQ3073536
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
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A18: Eigenvalues, singular values, and eigenvectors
05C75: Structural characterization of families of graphs
Related Items
The spectrum and toughness of regular graphs, On the Laplacian spectral ratio of connected graphs, Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph, Sharp spectral bounds for the vertex-connectivity of regular graphs, Graph toughness from Laplacian eigenvalues, Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
Cites Work