{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:16:48Z","timestamp":1760573808281,"version":"build-2065373602"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T00:00:00Z","timestamp":1756857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T00:00:00Z","timestamp":1756857600000},"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,10]]},"DOI":"10.1007\/s00373-025-02962-1","type":"journal-article","created":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T04:36:33Z","timestamp":1756874193000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Spectral Conditions for a Graph to have Strong Parity Factors"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7569-6223","authenticated-orcid":false,"given":"Yingui","family":"Pan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,3]]},"reference":[{"key":"2962_CR1","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall Inc, Upper Saddle River, NJ (2001)"},{"key":"2962_CR2","doi-asserted-by":"publisher","first-page":"113290","DOI":"10.1016\/j.disc.2022.113290","volume":"346","author":"D Kim","year":"2023","unstructured":"Kim, D.: Eigenvalues and parity factors in graphs with given minimum degree. Discrete Math. 346, 113290 (2023)","journal-title":"Discrete Math."},{"issue":"111901","key":"2962_CR3","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.disc.2017.08.035","volume":"341","author":"H Liu","year":"2018","unstructured":"Liu, H., Lu, H.: A degree condition for a graph to have $$(a, b)$$-parity factors. Discrete Math. 341(111901), 244\u2013252 (2018)","journal-title":"Discrete Math."},{"key":"2962_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02582935","volume":"1","author":"A Amahashi","year":"1985","unstructured":"Amahashi, A.: On factors with all degrees odd. Graphs Combin. 1, 111\u2013114 (1985)","journal-title":"Graphs Combin."},{"key":"2962_CR5","first-page":"31","volume":"58","author":"E Cho","year":"2021","unstructured":"Cho, E., Hyun, J., Park, J.: Sharp conditions for the existence of an even $$[a, b]$$-factor in a graph. Bull. Korean Math. Soc. 58, 31\u201346 (2021)","journal-title":"Bull. Korean Math. Soc."},{"key":"2962_CR6","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1137\/16M1079609","volume":"31","author":"H Lu","year":"2017","unstructured":"Lu, H., Wang, D.: A Tutte-type characterization for graph factors. SIAM J. Discret. Math. 31, 1149\u20131159 (2017)","journal-title":"SIAM J. Discret. Math."},{"key":"2962_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1002\/jgt.3190120305","volume":"12","author":"Y Cui","year":"1988","unstructured":"Cui, Y., Kano, M.: Some results on odd factors of graphs. J. Graph Theory 12, 327\u2013333 (1988)","journal-title":"J. Graph Theory"},{"key":"2962_CR8","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":"2962_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01889919","volume":"23","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: The factorization of graphs II. Acta Math. Acad. Sci. Hungar. 23, 223\u2013246 (1972)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"2962_CR10","doi-asserted-by":"publisher","first-page":"111580","DOI":"10.1016\/j.disc.2019.06.036","volume":"342","author":"H Lu","year":"2019","unstructured":"Lu, H., Kano, M., Yu, Q.: Characterizations of graphs $$G$$ having all $$[1, k]$$-factors in $$kG$$. Discrete Math. 342, 111580 (2019)","journal-title":"Discrete Math."},{"key":"2962_CR11","doi-asserted-by":"publisher","first-page":"111901","DOI":"10.1016\/j.disc.2020.111901","volume":"343","author":"H Lu","year":"2020","unstructured":"Lu, H., Kano, M.: Characterization of 1-tough graphs using factors. Discrete Math. 343, 111901 (2020)","journal-title":"Discrete Math."},{"key":"2962_CR12","volume-title":"Graph Factors and Matching Extensions","author":"Q Yu","year":"2010","unstructured":"Yu, Q., Liu, G.: Graph Factors and Matching Extensions. Springer, Berlin (2010)"},{"key":"2962_CR13","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.laa.2010.04.002","volume":"433","author":"H Lu","year":"2010","unstructured":"Lu, H., Wu, Z., Yang, X.: Eigenvalues and $$[1, n]$$-odd factors. Linear Algebra Appl. 433, 750\u2013757 (2010)","journal-title":"Linear Algebra Appl."},{"key":"2962_CR14","doi-asserted-by":"publisher","first-page":"111906","DOI":"10.1016\/j.disc.2020.111906","volume":"343","author":"S Kim","year":"2020","unstructured":"Kim, S., Park, J., Ree, H.: An odd $$[1, b]$$-factor in regular graphs from eigenvalues. Discrete Math. 343, 111906 (2020)","journal-title":"Discrete Math."},{"key":"2962_CR15","doi-asserted-by":"publisher","first-page":"112892","DOI":"10.1016\/j.disc.2022.112892","volume":"345","author":"D Fan","year":"2022","unstructured":"Fan, D., Liu, H., Lu, H.: Spectral radius and $$[a, b]$$-factors in graphs. Discret. Math. 345, 112892 (2022)","journal-title":"Discret. Math."},{"key":"2962_CR16","first-page":"273","volume":"1","author":"M Guan","year":"1960","unstructured":"Guan, M.: Graphic programming using odd or even points. Chin. Math. 1, 273\u2013277 (1960)","journal-title":"Chin. Math."},{"key":"2962_CR17","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1007\/s00373-020-02225-1","volume":"36","author":"C Bujt\u00e1s","year":"2020","unstructured":"Bujt\u00e1s, C., Jendrol\u2019, S., Tuza, Z.: On specific factors in graphs. Graphs Combin. 36, 1391\u20131399 (2020)","journal-title":"Graphs Combin."},{"key":"2962_CR18","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1007\/s00373-021-02293-x","volume":"37","author":"H Lu","year":"2021","unstructured":"Lu, H., Yang, Z., Zhang, X.: A characterization for graphs having strong parity factors. Graphs Combin. 37, 945\u2013949 (2021)","journal-title":"Graphs Combin."},{"key":"2962_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-981-7","volume-title":"Graphs and Matrices","author":"RB Bapat","year":"2010","unstructured":"Bapat, R.B.: Graphs and Matrices. Springer, New York (2010)"},{"key":"2962_CR20","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.laa.2024.03.026","volume":"691","author":"J Ai","year":"2024","unstructured":"Ai, J., Im, S., Kim, J., Lee, H., Zhang, L.: On the spectral radius of graphs with given maximum degree and girth. Linear Algebra Appl. 691, 182\u2013195 (2024)","journal-title":"Linear Algebra Appl."},{"key":"2962_CR21","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/0024-3795(95)00199-2","volume":"226\u2013228","author":"W Haemers","year":"1995","unstructured":"Haemers, W.: Interlacing eigenvalues and graphs. Linear Algebra Appl. 226\u2013228, 593\u2013616 (1995)","journal-title":"Linear Algebra Appl."},{"key":"2962_CR22","doi-asserted-by":"publisher","first-page":"103468","DOI":"10.1016\/j.ejc.2021.103468","volume":"101","author":"X Gu","year":"2022","unstructured":"Gu, X., Liu, M.: A tight lower bound on the matching number of graphs Vias Laplacian eigenvalues. Eur. J. Combin. 101, 103468 (2022)","journal-title":"Eur. J. Combin."},{"key":"2962_CR23","volume-title":"Spectra of Graphs","author":"AE Brouwer","year":"2011","unstructured":"Brouwer, A.E., Haemers, W.H.: Spectra of Graphs. Springer, New York (2011)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02962-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02962-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02962-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T05:11:38Z","timestamp":1760505098000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02962-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,3]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2962"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02962-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,9,3]]},"assertion":[{"value":"22 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 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 declare that they have no known completing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"101"}}