{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T23:28:50Z","timestamp":1786490930489,"version":"3.56.0"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271439"],"award-info":[{"award-number":["12271439"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12001434"],"award-info":[{"award-number":["12001434"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Optimization"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.disopt.2026.100958","type":"journal-article","created":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T16:17:34Z","timestamp":1786378654000},"page":"100958","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Spectral radius and size conditions for fractional (a,b,l)-critical graphs"],"prefix":"10.1016","volume":"61","author":[{"given":"Zengzhao","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6160-1761","authenticated-orcid":false,"given":"Ligong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weige","family":"Xi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.disopt.2026.100958_b1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/j.disopt.2026.100958_b2","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.113976","article-title":"Spectral radius, fractional [a,b]-factor and ID-factor-critical graphs","volume":"347","author":"Fan","year":"2024","journal-title":"Discrete Math."},{"key":"10.1016\/j.disopt.2026.100958_b3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.laa.2026.04.012","article-title":"Eigenvalues and factors: a survey","volume":"743","author":"Fan","year":"2026","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.disopt.2026.100958_b4","doi-asserted-by":"crossref","first-page":"3128","DOI":"10.1080\/03081087.2024.2306329","article-title":"Distance spectral radius and fractional matching in t-connected graphs","volume":"72","author":"Hu","year":"2024","journal-title":"Linear Multilinear Algebra"},{"key":"10.1016\/j.disopt.2026.100958_b5","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.laa.2025.03.012","article-title":"Spectral radius and fractional [a,b]-factor of graphs","volume":"715","author":"Li","year":"2025","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.disopt.2026.100958_b6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1017\/S0004972722001551","article-title":"On the size, spectral radius, distance spectral radius and fractional matchings in graphs","volume":"108","author":"Li","year":"2023","journal-title":"Bull. Aust. Math. Soc."},{"key":"10.1016\/j.disopt.2026.100958_b7","doi-asserted-by":"crossref","first-page":"4133","DOI":"10.1080\/03081087.2020.1865252","article-title":"Fractional matching number and spectral radius of nonnegative matrices of graphs","volume":"70","author":"Liu","year":"2022","journal-title":"Linear Multilinear Algebra"},{"key":"10.1016\/j.disopt.2026.100958_b8","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/j.laa.2023.08.010","article-title":"Fractional matching, factors and spectral radius in graphs involving minimum degree","volume":"677","author":"Lou","year":"2023","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.disopt.2026.100958_b9","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.ejc.2016.02.004","article-title":"Spectral radius and fractional matchings in graphs","volume":"55","author":"S.O","year":"2016","journal-title":"European J. Combin."},{"key":"10.1016\/j.disopt.2026.100958_b10","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.113975","article-title":"Spectral conditions for graphs having all (fractional) [a,b]-factors","volume":"347","author":"Zheng","year":"2024","journal-title":"Discrete Math."},{"key":"10.1016\/j.disopt.2026.100958_b11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.4134\/JKMS.2014.51.1.055","article-title":"Tigh toughness condition for fractional (g,f,n)-critical graphs","volume":"51","author":"Gao","year":"2014","journal-title":"J. Korean Math. Soc."},{"key":"10.1016\/j.disopt.2026.100958_b12","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/j.dam.2022.08.028","article-title":"Tight isolated toughness bound for fractional (k,n)-critical graphs","volume":"322","author":"Gao","year":"2022","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disopt.2026.100958_b13","doi-asserted-by":"crossref","DOI":"10.1080\/09540091.2023.2181482","article-title":"Isolated toughness and fractional (a,b,n)-critical graphs","volume":"35","author":"Gao","year":"2023","journal-title":"Connect. Sci."},{"key":"10.1016\/j.disopt.2026.100958_b14","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.114008","article-title":"A sufficient condition for a graph to be fractional (k,n)-critical","volume":"347","author":"Gao","year":"2024","journal-title":"Discrete Math."},{"key":"10.1016\/j.disopt.2026.100958_b15","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.ipl.2010.03.005","article-title":"On toughness and fractional (g,f,n)-critical graphs","volume":"110","author":"Liu","year":"2010","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.disopt.2026.100958_b16","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/s10255-022-1076-6","article-title":"Discussion on fractional (a,b,k)-critical covered graphs","volume":"38","author":"Zhang","year":"2022","journal-title":"Acta Math. Appl. Sin. Engl. Ser."},{"key":"10.1016\/j.disopt.2026.100958_b17","doi-asserted-by":"crossref","first-page":"1223","DOI":"10.1016\/j.crma.2009.09.022","article-title":"A minimum degree condition of fractional (k,m)-deleted graphs","volume":"347","author":"Zhou","year":"2009","journal-title":"C. R. Acad. Sci. Paris, Ser. I"},{"key":"10.1016\/j.disopt.2026.100958_b18","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/j.dam.2021.03.004","article-title":"A note on fractional ID-[a,b]-factor-critical covered graphs","volume":"319","author":"Zhou","year":"2022","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disopt.2026.100958_b19","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s11424-006-0491-8","article-title":"Degree conditions for graphs to be fractional (a,b,n)-critical graphs","volume":"19","author":"Li","year":"2006","journal-title":"J. Syst. Sci. Complex."},{"key":"10.1016\/j.disopt.2026.100958_b20","doi-asserted-by":"crossref","first-page":"435","DOI":"10.14317\/jami.2016.435","article-title":"Binding numbers and fractional (g,f,n)-critical graphs","volume":"34","author":"Zhou","year":"2016","journal-title":"J. Appl. Math. Inform."},{"key":"10.1016\/j.disopt.2026.100958_b21","series-title":"Graphs and Matrices","author":"Bapat","year":"2014"},{"key":"10.1016\/j.disopt.2026.100958_b22","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.laa.2004.03.026","article-title":"On the spectral radius of graphs with cut edges","volume":"389","author":"Liu","year":"2004","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.disopt.2026.100958_b23","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1006\/jctb.2000.1997","article-title":"A sharp upper bound of the spectral radius of graphs","volume":"81","author":"Hong","year":"2001","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"10.1016\/j.disopt.2026.100958_b24","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1017\/S0963548301004928","article-title":"Some inequalities for the largest eigenvalue of a graph","volume":"11","author":"Nikiforov","year":"2002","journal-title":"Combin. Probab. Comput."}],"container-title":["Discrete Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528626000319?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528626000319?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T22:40:14Z","timestamp":1786488014000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1572528626000319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":24,"alternative-id":["S1572528626000319"],"URL":"https:\/\/doi.org\/10.1016\/j.disopt.2026.100958","relation":{},"ISSN":["1572-5286"],"issn-type":[{"value":"1572-5286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Spectral radius and size conditions for fractional -critical graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disopt.2026.100958","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"100958"}}