{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T07:49:43Z","timestamp":1780472983532,"version":"3.54.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T00:00:00Z","timestamp":1721174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T00:00:00Z","timestamp":1721174400000},"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":["J Supercomput"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s11227-024-06355-8","type":"journal-article","created":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T14:01:53Z","timestamp":1721224913000},"page":"23357-23366","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Spanning k-trees and distance spectral radius in graphs"],"prefix":"10.1007","volume":"80","author":[{"given":"Sizhong","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiancheng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,17]]},"reference":[{"key":"6355_CR1","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":"6355_CR2","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.jctb.2008.06.008","volume":"99","author":"S Cioab\u01ce","year":"2009","unstructured":"Cioab\u01ce S, Gregory D, Haemers W (2009) Matchings in regular graphs from eigenvalue. J Combinat Theory Ser B 99:287\u2013297","journal-title":"J Combinat Theory Ser B"},{"key":"6355_CR3","doi-asserted-by":"publisher","first-page":"4400","DOI":"10.1016\/j.laa.2011.03.065","volume":"436","author":"S Li","year":"2012","unstructured":"Li S, Zhang M (2012) On the signless Laplacian index of cacti with a given number of pendant vertices. Linear Algebra Appl 436:4400\u20134411","journal-title":"Linear Algebra Appl"},{"key":"6355_CR4","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.laa.2020.06.004","volume":"614","author":"S O","year":"2021","unstructured":"O S (2021) Spectral radius and matchings in graphs. Linear Algebra Appl 614:316\u2013324","journal-title":"Linear Algebra Appl"},{"key":"6355_CR5","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.dam.2021.08.008","volume":"304","author":"Y Zhang","year":"2021","unstructured":"Zhang Y, Lin H (2021) Perfect matching and distance spectral radius in graphs and bipartite graphs. Discrete Appl Math 304:315\u2013322","journal-title":"Discrete Appl Math"},{"key":"6355_CR6","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0012-365X(01)00214-X","volume":"243","author":"K Ando","year":"2002","unstructured":"Ando K, Egawa Y, Kaneko A, Kawarabayashi K, Matsuda H (2002) Path factors in claw-free graphs. Discrete Math 243:195\u2013200","journal-title":"Discrete Math"},{"issue":"1","key":"6355_CR7","first-page":"3","volume":"66","author":"S Zhou","year":"2023","unstructured":"Zhou S (2023) Degree conditions and path factors with inclusion or exclusion properties. Bulletin Mathematique de la Societe des Sciences Mathematiques de Roumanie 66(1):3\u201314","journal-title":"Bulletin Mathematique de la Societe des Sciences Mathematiques de Roumanie"},{"issue":"1","key":"6355_CR8","first-page":"25","volume":"23","author":"H Liu","year":"2022","unstructured":"Liu H (2022) Binding number for path-factor uniform graphs, proceedings of the romanian academy, series a: mathematics, physics, technical sciences, information. Science 23(1):25\u201332","journal-title":"Science"},{"issue":"3","key":"6355_CR9","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 Mathematicae 97(3):489\u2013500","journal-title":"Aequationes Mathematicae"},{"issue":"3","key":"6355_CR10","first-page":"229","volume":"23","author":"S Wang","year":"2022","unstructured":"Wang S, Zhang W (2022) Independence number, minimum degree and path-factors in graphs. Proc Romanian Acad Series Math Phys Techn Sci Info Sci 23(3):229\u2013234","journal-title":"Proc Romanian Acad Series Math Phys Techn Sci Info Sci"},{"issue":"6","key":"6355_CR11","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"},{"issue":"1","key":"6355_CR12","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. Discussiones Mathematicae Graph Theory 43(1):233\u2013244","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"6355_CR13","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"},{"issue":"5","key":"6355_CR14","doi-asserted-by":"publisher","first-page":"113940","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"},{"issue":"3","key":"6355_CR15","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 Mathematicae 98(3):727\u2013737","journal-title":"Aequationes Mathematicae"},{"issue":"4","key":"6355_CR16","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s00010-021-00852-4","volume":"96","author":"S Zhou","year":"2022","unstructured":"Zhou S, Wu J, Bian Q (2022) On path-factor critical deleted (or covered) graphs. Aequationes Mathematicae 96(4):795\u2013802","journal-title":"Aequationes Mathematicae"},{"issue":"4","key":"6355_CR17","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1007\/s00373-012-1168-9","volume":"29","author":"M Kouider","year":"2013","unstructured":"Kouider M (2013) Sufficient condition for the existence of an even $$[a, b]$$-factor in graph. Graphs Combinat 29(4):1051\u20131057","journal-title":"Graphs Combinat"},{"issue":"4","key":"6355_CR18","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1002\/jgt.20008","volume":"46","author":"M Kouider","year":"2004","unstructured":"Kouider M, Lonc Z (2004) Stability number and $$[a, b]$$-factors in graphs. J Graph Theory 46(4):254\u2013264","journal-title":"J Graph Theory"},{"issue":"3","key":"6355_CR19","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.2298\/FIL2403101W","volume":"38","author":"S Wang","year":"2024","unstructured":"Wang S, Zhang W (2024) Some results on star-factor deleted graphs. Filomat 38(3):1101\u20131107","journal-title":"Filomat"},{"issue":"6","key":"6355_CR20","first-page":"2177","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"},{"key":"6355_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.laa.2022.12.018","volume":"661","author":"S Zhou","year":"2023","unstructured":"Zhou S, Liu H (2023) Two sufficient conditions for odd $$[1, b]$$-factors in graphs. Linear Algebra Appl 661:149\u2013162","journal-title":"Linear Algebra Appl"},{"key":"6355_CR22","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"},{"key":"6355_CR23","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.dam.2022.07.020","volume":"354","author":"S Zhou","year":"2024","unstructured":"Zhou S (2024) Remarks on restricted fractional $$(g, f)$$-factors in graphs. Discrete Appl Math 354:271\u2013278","journal-title":"Discrete Appl Math"},{"key":"6355_CR24","doi-asserted-by":"publisher","unstructured":"Zhou S, Zhang Y (2024) Sufficient conditions for fractional $$[a,b]$$-deleted graphs. Indian J Pure Appl Math. https:\/\/doi.org\/10.1007\/s13226-024-00564-w","DOI":"10.1007\/s13226-024-00564-w"},{"issue":"1","key":"6355_CR25","first-page":"11","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 Romanian Acad Series Math Phys Tech Sci Info Sci 24(1):11\u201318","journal-title":"Proc Romanian Acad Series Math Phys Tech Sci Info Sci"},{"key":"6355_CR26","unstructured":"Zhou S, Pan Q, Xu Y (2024) A new result on orthogonal factorizations in networks. Filomat 38(20) (in press)"},{"key":"6355_CR27","doi-asserted-by":"crossref","unstructured":"Zhou S, Zhang Y, Liu H (2024), Some properties of $$(a,b,k)$$-critical graphs. Filomat 38(16) (in press)","DOI":"10.2298\/FIL2404329Z"},{"issue":"4","key":"6355_CR28","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1002\/jgt.1013","volume":"37","author":"G Ding","year":"2001","unstructured":"Ding G, Johnson T, Seymour P (2001) Spanning trees with many leaves. J Graph Theory 37(4):189\u2013197","journal-title":"J Graph Theory"},{"issue":"1\u20133","key":"6355_CR29","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.disc.2004.04.005","volume":"285","author":"L Gargano","year":"2004","unstructured":"Gargano L, Hammar M, Hell P, Stacho L, Vaccaro U (2004) Spanning spiders and light-splitting switches. Discrete Math 285(1\u20133):83\u201395","journal-title":"Discrete Math"},{"key":"6355_CR30","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s003730170059","volume":"17","author":"A Kyaw","year":"2001","unstructured":"Kyaw A (2001) A sufficient condition for a graph to have a $$k$$-tree. Graphs Combinat 17:113\u2013121","journal-title":"Graphs Combinat"},{"issue":"1","key":"6355_CR31","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01375473","volume":"11","author":"V Neumann-Lara","year":"1991","unstructured":"Neumann-Lara V, Rivera-Campo E (1991) Spanning trees with bounded degrees. Combinatorica 11(1):55\u201361","journal-title":"Combinatorica"},{"key":"6355_CR32","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 Combinat 101:103468","journal-title":"Eur J Combinat"},{"key":"6355_CR33","doi-asserted-by":"publisher","unstructured":"Fan D, Goryainov S, Huang X, Lin H (2021) The spanning $$k$$-trees, perfect matchings and spectral radius of graphs. Linear Multilinear Algebra. https:\/\/doi.org\/10.1080\/03081087.2021.1985055","DOI":"10.1080\/03081087.2021.1985055"},{"key":"6355_CR34","volume-title":"Algebraic combinatorics","author":"C Godsil","year":"1993","unstructured":"Godsil C (1993) Algebraic combinatorics. Chapman and Hall Mathematics Series, New York"},{"key":"6355_CR35","doi-asserted-by":"crossref","unstructured":"Brouwer A Haemers W (2011) Spectra of graphs\u2014monograph. Springer","DOI":"10.1007\/978-1-4614-1939-6"},{"key":"6355_CR36","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"},{"key":"6355_CR37","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF01788671","volume":"5","author":"S Win","year":"1989","unstructured":"Win S (1989) On a connection between the existence of $$k$$-trees and the toughness of a graph. Graphs Combinat 5:201\u2013205","journal-title":"Graphs Combinat"},{"issue":"3","key":"6355_CR38","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/(SICI)1097-0118(200003)33:3<125::AID-JGT1>3.0.CO;2-X","volume":"33","author":"M Ellingham","year":"2000","unstructured":"Ellingham M, Zha X (2000) Toughness, trees, and walks. J Graph Theory 33(3):125\u2013137","journal-title":"J Graph Theory"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06355-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06355-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06355-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T08:28:15Z","timestamp":1732436895000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06355-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,17]]},"references-count":38,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["6355"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06355-8","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,17]]},"assertion":[{"value":"7 July 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2024","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"}}]}}