{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T07:59:24Z","timestamp":1780473564348,"version":"3.54.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,2,2]],"date-time":"2025-02-02T00:00:00Z","timestamp":1738454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,2]],"date-time":"2025-02-02T00:00:00Z","timestamp":1738454400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"crossref","award":["BK20241949"],"award-info":[{"award-number":["BK20241949"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"crossref","award":["BK20241949"],"award-info":[{"award-number":["BK20241949"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100007129","name":"Shandong Provincial Natural Science Foundation","doi-asserted-by":"crossref","award":["ZR2023MA078"],"award-info":[{"award-number":["ZR2023MA078"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-024-06902-3","type":"journal-article","created":{"date-parts":[[2025,2,2]],"date-time":"2025-02-02T17:26:16Z","timestamp":1738517176000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Spectral radius and k-factor-critical graphs"],"prefix":"10.1007","volume":"81","author":[{"given":"Sizhong","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiren","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuli","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,2,2]]},"reference":[{"key":"6902_CR1","doi-asserted-by":"publisher","first-page":"3006","DOI":"10.1016\/j.disc.2007.03.012","volume":"307","author":"N Ananchuen","year":"2007","unstructured":"Ananchuen N, Plummer M (2007) 3-Factor-criticality in domination critical graphs. Discrete Math 307:3006\u20133015","journal-title":"Discrete Math"},{"key":"6902_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0012-365X(02)00564-2","volume":"265","author":"N Ananchuen","year":"2003","unstructured":"Ananchuen N, Saito A (2003) Factor criticality and complete closure of graphs. Discrete Math 265:13\u201321","journal-title":"Discrete Math"},{"key":"6902_CR3","volume-title":"Graphs and matrices","author":"R Bapat","year":"2018","unstructured":"Bapat R (2018) Graphs and matrices, 2nd edn. Hindustan Book Agency, New Delhi","edition":"2"},{"key":"6902_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.laa.2004.08.014","volume":"395","author":"A Brouwer","year":"2005","unstructured":"Brouwer A, Haemers W (2005) Eigenvalues and perfect matchings. Linear Algebra Appl 395:155\u2013162","journal-title":"Linear Algebra Appl"},{"key":"6902_CR5","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1007\/s00373-020-02184-7","volume":"36","author":"G Dai","year":"2020","unstructured":"Dai G, Hu Z (2020) $$P_3$$-factors in the square of a tree. Graphs Combin 36:1913\u20131925","journal-title":"Graphs Combin"},{"key":"6902_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1002\/jgt.21883","volume":"82","author":"Y Egawa","year":"2016","unstructured":"Egawa Y, Furuya M (2016) Perfect matchings avoiding several independent edges in a star-free graph. J Graph Theory 82:33\u201344","journal-title":"J Graph Theory"},{"key":"6902_CR7","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0012-365X(99)00104-1","volume":"205","author":"H Enomoto","year":"1999","unstructured":"Enomoto H, Plummer M, Saito A (1999) Neighborhood unions and factor critical graphs. Discrete Math 205:217\u2013220","journal-title":"Discrete Math"},{"key":"6902_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.7151\/dmgt.1022","volume":"16","author":"O Favaron","year":"1996","unstructured":"Favaron O (1996) On $$k$$-factor-critical graphs. Discuss Math Graph Theory 16:41\u201351","journal-title":"Discuss Math Graph Theory"},{"key":"6902_CR9","doi-asserted-by":"publisher","first-page":"4392","DOI":"10.1002\/int.22464","volume":"36","author":"W Gao","year":"2021","unstructured":"Gao W, Chen Y, Wang Y (2021) Network vulnerability parameter and results on two surfaces. Int J Intell Syst 36:4392\u20134414","journal-title":"Int J Intell Syst"},{"key":"6902_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106162","volume":"172","author":"W Gao","year":"2021","unstructured":"Gao W, Wang W (2021) Tight binding number bound for $$P_{\\ge 3}$$-factor uniform graphs. Inform Process Lett 172:106162","journal-title":"Inform Process Lett"},{"key":"6902_CR11","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.dam.2022.08.028","volume":"322","author":"W Gao","year":"2022","unstructured":"Gao W, Wang W, Chen Y (2022) Tight isolated toughness bound for fractional $$(k, n)$$-critical graphs. Discrete Appl Math 322:194\u2013202","journal-title":"Discrete Appl Math"},{"key":"6902_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2021.103468","volume":"101","author":"X Gu","year":"2022","unstructured":"Gu X, Liu M (2022) A tight lower bound on the matching number of graphs via Laplacian eigenvalues. Eur J Combin 101:103468","journal-title":"Eur J Combin"},{"key":"6902_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/(SICI)1097-0118(199805)28:1<39::AID-JGT4>3.0.CO;2-G","volume":"28","author":"R Johansson","year":"1998","unstructured":"Johansson R (1998) An El-Zah\u00e1r type condition ensuring path-factors. J Graph Theory 28:39\u201342","journal-title":"J Graph Theory"},{"key":"6902_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112588","volume":"344","author":"S Li","year":"2021","unstructured":"Li S, Miao S (2021) Characterizing $$P_{\\ge 2}$$-factor and $$P_{\\ge 2}$$-factor covered graphs with respect to the size or the spectral radius. Discrete Math 344:112588","journal-title":"Discrete Math"},{"issue":"1","key":"6902_CR15","first-page":"25","volume":"23","author":"H Liu","year":"2022","unstructured":"Liu H (2022) Binding number for path-factor uniform graphs. Proc Rom Acad Ser A Math Phys Tech Sci Inf Sci 23(1):25\u201332","journal-title":"Proc Rom Acad Ser A Math Phys Tech Sci Inf Sci"},{"key":"6902_CR16","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.dam.2024.07.043","volume":"359","author":"H Liu","year":"2024","unstructured":"Liu H, Pan X (2024) Independence number and minimum degree for path-factor critical uniform graphs. Discrete Appl Math 359:153\u2013158","journal-title":"Discrete Appl Math"},{"issue":"10","key":"6902_CR17","doi-asserted-by":"publisher","first-page":"3315","DOI":"10.2298\/FIL2310315L","volume":"37","author":"X Lv","year":"2023","unstructured":"Lv X (2023) A degree condition for graphs being fractional $$(a, b, k)$$-critical covered. Filomat 37(10):3315\u20133320","journal-title":"Filomat"},{"key":"6902_CR18","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.laa.2020.06.004","volume":"614","author":"O Suil","year":"2021","unstructured":"Suil O (2021) Spectral radius and matchings in graphs. Linear Algebra Appl 614:316\u2013324","journal-title":"Linear Algebra Appl"},{"key":"6902_CR19","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0012-365X(99)00234-4","volume":"215","author":"M Plummer","year":"2000","unstructured":"Plummer M, Saito A (2000) Closure and factor-critical graphs. Discrete Math 215:171\u2013179","journal-title":"Discrete Math"},{"issue":"5","key":"6902_CR20","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1007\/s11425-009-0192-6","volume":"53","author":"T Wang","year":"2010","unstructured":"Wang T, Yu Q (2010) A conjecture on $$k$$-factor-critical and 3-$$\\gamma$$-critical graphs. Sci China Math 53(5):1385\u20131391","journal-title":"Sci China Math"},{"issue":"6","key":"6902_CR21","doi-asserted-by":"publisher","first-page":"2177","DOI":"10.2298\/FIL2406177W","volume":"38","author":"J Wu","year":"2024","unstructured":"Wu J (2024) A sufficient condition for the existence of fractional $$(g, f, n)$$-critical covered graphs. Filomat 38(6):2177\u20132183","journal-title":"Filomat"},{"issue":"6","key":"6902_CR22","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1007\/s00010-024-01112-x","volume":"98","author":"J Wu","year":"2024","unstructured":"Wu J (2024) Characterizing spanning trees via the size or the spectral radius of graphs. Aequationes Math 98(6):1441\u20131455","journal-title":"Aequationes Math"},{"issue":"6","key":"6902_CR23","doi-asserted-by":"publisher","first-page":"4317","DOI":"10.1051\/ro\/2022208","volume":"56","author":"J Wu","year":"2022","unstructured":"Wu J (2022) Path-factor critical covered graphs and path-factor uniform graphs. RAIRO Oper Res 56(6):4317\u20134325","journal-title":"RAIRO Oper Res"},{"key":"6902_CR24","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.laa.2019.04.013","volume":"577","author":"L You","year":"2019","unstructured":"You L, Yang M, So W, Xi W (2019) On the spectrum of an equitable quotient matrix and its application. Linear Algebra Appl 577:21\u201340","journal-title":"Linear Algebra Appl"},{"issue":"1","key":"6902_CR25","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/s10255-022-1064-x","volume":"38","author":"S Zhai","year":"2022","unstructured":"Zhai S, Wei E, Zhang F (2022) The Characterization of $$p$$-factor-critical graphs. Acta Math Appl Sin Engl Ser 38(1):154\u2013158","journal-title":"Acta Math Appl Sin Engl Ser"},{"key":"6902_CR26","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.dam.2021.05.022","volume":"323","author":"S Zhou","year":"2022","unstructured":"Zhou S (2022) A neighborhood union condition for fractional $$(a, b, k)$$-critical covered graphs. Discrete Appl Math 323:343\u2013348","journal-title":"Discrete Appl Math"},{"issue":"2","key":"6902_CR27","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/s10255-022-1096-2","volume":"39","author":"S Zhou","year":"2023","unstructured":"Zhou S (2023) Path factors and neighborhoods of independent sets in graphs. Acta Math Appl Sin Engl Ser 39(2):232\u2013238","journal-title":"Acta Math Appl Sin Engl Ser"},{"issue":"1","key":"6902_CR28","doi-asserted-by":"publisher","first-page":"233","DOI":"10.7151\/dmgt.2364","volume":"43","author":"S Zhou","year":"2023","unstructured":"Zhou S (2023) Some results on path-factor critical avoidable graphs. Discuss Math Graph Theory 43(1):233\u2013244","journal-title":"Discuss Math Graph Theory"},{"issue":"3","key":"6902_CR29","doi-asserted-by":"publisher","first-page":"761","DOI":"10.7151\/dmgt.2401","volume":"43","author":"S Zhou","year":"2023","unstructured":"Zhou S, Bian Q, Sun Z (2023) Two sufficient conditions for component factors in graphs. Discuss Math Graph Theory 43(3):761\u2013766","journal-title":"Discuss Math Graph Theory"},{"issue":"1","key":"6902_CR30","doi-asserted-by":"publisher","first-page":"11","DOI":"10.59277\/PRA-SER.A.24.1.02","volume":"24","author":"S Zhou","year":"2023","unstructured":"Zhou S, Pan Q, Xu L (2023) Isolated toughness for fractional $$(2, b, k)$$-critical covered graphs. Proc Rom Acad Ser A Math Phys Tech Sci Inf Sci 24(1):11\u201318","journal-title":"Proc Rom Acad Ser A Math Phys Tech Sci Inf Sci"},{"issue":"20","key":"6902_CR31","first-page":"7235","volume":"38","author":"S Zhou","year":"2024","unstructured":"Zhou S, Pan Q, Xu Y (2024) A new result on orthogonal factorizations in networks. Filomat 38(20):7235\u20137244","journal-title":"Filomat"},{"issue":"3","key":"6902_CR32","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s13226-022-00286-x","volume":"54","author":"S Zhou","year":"2023","unstructured":"Zhou S, Sun Z, Bian Q (2023) Isolated toughness and path-factor uniform graphs (II). Indian J Pure Appl Math 54(3):689\u2013696","journal-title":"Indian J Pure Appl Math"},{"issue":"3","key":"6902_CR33","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s00010-023-00944-3","volume":"97","author":"S Zhou","year":"2023","unstructured":"Zhou S, Sun Z, Liu H (2023) Some sufficient conditions for path-factor uniform graphs. Aequationes Math 97(3):489\u2013500","journal-title":"Aequationes Math"},{"issue":"3","key":"6902_CR34","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s00010-024-01075-z","volume":"98","author":"S Zhou","year":"2024","unstructured":"Zhou S, Sun Z, Liu H (2024) Distance signless Laplacian spectral radius for the existence of path-factors in graphs. Aequationes Math 98(3):727\u2013737","journal-title":"Aequationes Math"},{"issue":"3","key":"6902_CR35","doi-asserted-by":"publisher","first-page":"154","DOI":"10.55016\/ojs\/cdm.v19i3.72597","volume":"19","author":"S Zhou","year":"2024","unstructured":"Zhou S, Xu Y, Sun Z (2024) Some results about star-factors in graphs. Contrib Discrete Math 19(3):154\u2013162","journal-title":"Contrib Discrete Math"},{"issue":"16","key":"6902_CR36","doi-asserted-by":"publisher","first-page":"23357","DOI":"10.1007\/s11227-024-06355-8","volume":"80","author":"S Zhou","year":"2024","unstructured":"Zhou S, Wu J (2024) Spanning $$k$$-trees and distance spectral radius in graphs. J Supercomput 80(16):23357\u201323366","journal-title":"J Supercomput"},{"issue":"16","key":"6902_CR37","first-page":"5885","volume":"38","author":"S Zhou","year":"2024","unstructured":"Zhou S, Zhang Y, Liu H (2024) Some properties of $$(a, b, k)$$-critical graphs. Filomat 38(16):5885\u20135894","journal-title":"Filomat"},{"issue":"5","key":"6902_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2024.113940","volume":"347","author":"S Zhou","year":"2024","unstructured":"Zhou S, Zhang Y, Sun Z (2024) The $$A_{\\alpha }$$-spectral radius for path-factors in graphs. Discrete Math 347(5):113940","journal-title":"Discrete Math"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06902-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06902-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06902-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,2]],"date-time":"2025-02-02T17:26:19Z","timestamp":1738517179000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06902-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,2]]},"references-count":38,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["6902"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06902-3","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,2]]},"assertion":[{"value":"27 December 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"456"}}