{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T19:11:33Z","timestamp":1776280293387,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s00373-025-02903-y","type":"journal-article","created":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T11:39:36Z","timestamp":1740829176000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Two Variants of Toughness of a Graph and its Eigenvalues"],"prefix":"10.1007","volume":"41","author":[{"given":"Hongzhang","family":"Chen","sequence":"first","affiliation":[]},{"given":"Jianxi","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2046-3040","authenticated-orcid":false,"given":"Shou-Jun","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,1]]},"reference":[{"key":"2903_CR1","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1023\/A:1022453926717","volume":"4","author":"N Alon","year":"1995","unstructured":"Alon, N.: Tough Ramsey graphs without short cycles. J. Algebraic Combin. 4, 189\u2013195 (1995)","journal-title":"J. Algebraic Combin."},{"key":"2903_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0166-218X(90)90001-S","volume":"28","author":"D Bauer","year":"1990","unstructured":"Bauer, D., Hakimi, S., Schmeichel, E.: Recognizing tough graphs is NP-hard. Discrete Appl. Math. 28, 191\u2013195 (1990)","journal-title":"Discrete Appl. Math."},{"key":"2903_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-006-0649-0","volume":"22","author":"D Bauer","year":"2006","unstructured":"Bauer, D., Broersma, H., Schmeichel, E.: Toughness in graphs\u2014a survey. Graphs Combin. 22, 1\u201335 (2006)","journal-title":"Graphs Combin."},{"key":"2903_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London (1976)"},{"key":"2903_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0024-3795(95)00154-J","volume":"226","author":"A Brouwer","year":"1995","unstructured":"Brouwer, A.: Toughness and spectrum of a graph. Linear Algebra Appl. 226, 267\u2013271 (1995)","journal-title":"Linear Algebra Appl."},{"key":"2903_CR6","doi-asserted-by":"crossref","unstructured":"Brouwer, A., Haemers, W.: Spectra of Graphs, Springer Universitext, (2012)","DOI":"10.1007\/978-1-4614-1939-6"},{"key":"2903_CR7","doi-asserted-by":"publisher","first-page":"3307","DOI":"10.1007\/s40840-022-01381-2","volume":"45","author":"H Chen","year":"2022","unstructured":"Chen, H., Li, J.: $$\\ell $$-connectivity, integrity, tenacity, toughness and eigenvalues of graphs. Bull. Malays. Math. Sci. Soc. 45, 3307\u20133320 (2022)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"2903_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s40314-024-02595-9","volume":"43","author":"H Chen","year":"2024","unstructured":"Chen, H., Li, J., Shiu, W.C.: Spectral bounds for the vulnerability parameters of graphs. Comput. Appl. Math. 43, 87 (2024)","journal-title":"Comput. Appl. Math."},{"key":"2903_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2024.114191","volume":"347","author":"Y Chen","year":"2024","unstructured":"Chen, Y., Fan, D., Lin, H.: Toughness and spectral radius in graphs. Discrete Math. 347, 114191 (2024)","journal-title":"Discrete Math."},{"key":"2903_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","volume":"5","author":"V Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Tough graphs and Hamiltonian circuits. Discrete Math. 5, 215\u2013228 (1973)","journal-title":"Discrete Math."},{"key":"2903_CR11","volume-title":"An Introduction to the Theory of Graph Spectra, London Mathematical Society Student Texts 75","author":"D Cvetkovi\u0107","year":"2010","unstructured":"Cvetkovi\u0107, D., Rowlinson, P., Simi\u0107, S.: An Introduction to the Theory of Graph Spectra, London Mathematical Society Student Texts 75. Cambridge Univ. Press, Cambridge (2010)"},{"key":"2903_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.disc.2004.04.007","volume":"285","author":"K Das","year":"2004","unstructured":"Das, K.: Maximizing the sum of the squares of the degrees of a graph. Discrete Math. 285, 57\u201366 (2004)","journal-title":"Discrete Math."},{"key":"2903_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0012-365X(98)00059-4","volume":"189","author":"H Enomoto","year":"1998","unstructured":"Enomoto, H.: Toughness and the existence of $$k$$-factors. III, Discrete Math. 189, 277\u2013282 (1998)","journal-title":"III, Discrete Math."},{"key":"2903_CR14","doi-asserted-by":"publisher","first-page":"7264","DOI":"10.1080\/03081087.2021.1985055","volume":"70","author":"D Fan","year":"2022","unstructured":"Fan, D., Goryainov, S., Huang, X., Lin, H.: The spanning $$k$$-trees, perfect matchings and spectral radius of graphs. Linear Multilinear Algebra 70, 7264\u20137275 (2022)","journal-title":"Linear Multilinear Algebra"},{"key":"2903_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2023.103701","volume":"110","author":"D Fan","year":"2023","unstructured":"Fan, D., Lin, H., Lu, H.: Toughness, hamiltonicity and spectral radius in graphs. Eur. J. Combin. 110, 103701 (2023)","journal-title":"Eur. J. Combin."},{"key":"2903_CR16","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1002\/int.22335","volume":"36","author":"W Gao","year":"2021","unstructured":"Gao, W., Wang, W., Chen, Y.: Tight bounds for the existence of path factors in network vulnerability parameter settings. Int. J. Intell. Syst. 36, 1133\u20131158 (2021)","journal-title":"Int. J. Intell. Syst."},{"key":"2903_CR17","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1137\/20M1372652","volume":"35","author":"X Gu","year":"2021","unstructured":"Gu, X.: A proof of Brouwer\u2019s toughness conjecture. SIAM J. Discrete Math. 35, 948\u2013952 (2021)","journal-title":"SIAM J. Discrete Math."},{"key":"2903_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.5802\/alco.197","volume":"5","author":"X Gu","year":"2022","unstructured":"Gu, X., Haemers, W.: Graph toughness from Laplacian eigenvalues. Algebraic Combin. 5, 53\u201361 (2022)","journal-title":"Algebraic Combin."},{"key":"2903_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-024-01353-8","author":"X Gu","year":"2024","unstructured":"Gu, X., Liu, M.: A unified combinatorial view beyond some spectral properties. J. Algebraic Combin. (2024). https:\/\/doi.org\/10.1007\/s10801-024-01353-8","journal-title":"J. Algebraic Combin."},{"key":"2903_CR20","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(88)90069-6","volume":"71","author":"G Hendry","year":"1988","unstructured":"Hendry, G.: Scattering number and extremal non-Hamiltonian graphs. Discrete Math. 71, 165\u2013175 (1988)","journal-title":"Discrete Math."},{"key":"2903_CR21","doi-asserted-by":"publisher","first-page":"12707","DOI":"10.1016\/j.amc.2022.127075","volume":"425","author":"X Huang","year":"2022","unstructured":"Huang, X., Das, K.C., Zhu, S.: Toughness and normalized Laplacian eigenvalues of graphs. Appl. Math. Comput. 425, 12707 (2022)","journal-title":"Appl. Math. Comput."},{"key":"2903_CR22","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0012-365X(82)90145-5","volume":"39","author":"J Jamrozik","year":"1982","unstructured":"Jamrozik, J., Kalinowski, R., Skupien, Z.: A catalogue of small maximal non-Hamiltonian graphs. Discrete Math. 39, 229\u2013234 (1982)","journal-title":"Discrete Math."},{"key":"2903_CR23","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","volume":"24","author":"H Jung","year":"1978","unstructured":"Jung, H.: On a class of posets and the corresponding comparability graphs. J. Combin. Theory Ser. B 24, 125\u2013133 (1978)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2903_CR24","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0024-3795(01)00312-3","volume":"341","author":"S Kirkland","year":"2002","unstructured":"Kirkland, S., Molitierno, J.J., Neumann, M., Shader, B.L.: On graphs with equal algebraic and vertex connectivity. Linear Algebra Appl. 341, 45\u201356 (2002)","journal-title":"Linear Algebra Appl."},{"key":"2903_CR25","first-page":"450","volume":"83","author":"Y Li","year":"2018","unstructured":"Li, Y., Shi, Y., Gu, X.: Spectrum bounds for the scattering number, integrity, tenacity of regular graphs, Future Gener. Comput. Syst. 83, 450\u2013453 (2018)","journal-title":"Comput. Syst."},{"key":"2903_CR26","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.dam.2024.09.019","volume":"361","author":"J Lou","year":"2025","unstructured":"Lou, J., Liu, R., Shu, J.: Toughness and distance spectral radius in graphs involving minimum degree. Discrete Appl. Math. 361, 34\u201347 (2025)","journal-title":"Discrete Appl. Math."},{"key":"2903_CR27","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1016\/j.jctb.2006.12.003","volume":"97","author":"M Lu","year":"2007","unstructured":"Lu, M., Liu, H., Tian, F.: Laplacian spectral bounds for clique and independence numbers of graphs. J. Combin. Theory Ser. B 97, 726\u2013732 (2007)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2903_CR28","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1002\/1097-0037(200103)37:2<102::AID-NET5>3.0.CO;2-S","volume":"37","author":"S Zhang","year":"2001","unstructured":"Zhang, S., Wang, Z.: Scattering number in graphs. Networks 37, 102\u2013106 (2001)","journal-title":"Networks"},{"key":"2903_CR29","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1080\/00207160211919","volume":"79","author":"S Zhang","year":"2002","unstructured":"Zhang, S., Li, X., Han, X.: Computing the scattering number of graphs. Int. J. Comput. Math. 79, 179\u2013187 (2002)","journal-title":"Int. J. Comput. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02903-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02903-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02903-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:16:58Z","timestamp":1746253018000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02903-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,1]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2903"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02903-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,1]]},"assertion":[{"value":"7 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"41"}}