Abstract
We give some algebraic conditions for t-tough graphs in terms of the Laplacian eigenvalues and adjacency eigenvalues of graphs.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
A. E. Brouwer: Toughness and spectrum of a graph. Linear Algebra Appl. 226–228 (1995), 267–271.
A. E. Brouwer and W. H. Haemers: Eigenvalues and perfect matchings. Linear Algebra Appl. 395 (2005), 155–162.
V. Chvátal: New directions in Hamiltonian graph theory in New Directions in the Theory of Graphs (F. Harary, ed.). Academic Press, New York, 1973, pp. 65–95.
V. Chvátal: Tough graphs and hamiltonian circuits. Discrete Math. 306 (2006), 910–917.
H. Enomoto, B. Jackson and P. Katerinis: Toughness and the existence of k-factors. Journal of Graph Theory 9 (1985), 87–95.
W. H. Haemers: Interlacing eigenvalues and graphs. Linear Algebra Appl. 226–228 (1995), 593–616.
H. A. Jung: Note on Hamiltonian graphs, in Recent Advances in Graph Theory (M. Fiedler, ed.). Academia, Prague, 1975, pp. 315–321.
B. Mohar: A domain monotonicity theorem for graphs and hamiltonicity. Discrete Appl. Math. 36 (1992), 169–177.
J. Vanden Heuvel: Hamilton cycles and eigenvalues of graphs. Linear Algebra Appl. 226–228 (1995), 723–730.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by NNSF of China (No. 10771080) and SRFDP of China (No. 20070574006).
Rights and permissions
About this article
Cite this article
Liu, B., Chen, S. Algebraic conditions for t-tough graphs. Czech Math J 60, 1079–1089 (2010). https://doi.org/10.1007/s10587-010-0073-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10587-010-0073-8