{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T17:16:31Z","timestamp":1783185391670,"version":"3.54.6"},"reference-count":25,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"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\/501100014188","name":"Ministry of Science and ICT, South Korea","doi-asserted-by":"publisher","award":["RS-2024-00356153"],"award-info":[{"award-number":["RS-2024-00356153"]}],"id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["202506290152"],"award-info":[{"award-number":["202506290152"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.disc.2026.115232","type":"journal-article","created":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T13:44:43Z","timestamp":1779889483000},"page":"115232","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["The maximum spectral radius of k\u202f\u22c5\u202fP3-free graphs"],"prefix":"10.1016","volume":"349","author":[{"given":"Yanting","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jongyook","family":"Park","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ligong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115232_br0010","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1017\/S0963548311000460","article-title":"Tur\u00e1n numbers of multiple paths and equibipartite forests","volume":"20","author":"Bushaw","year":"2011","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.disc.2026.115232_br0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2025.104226","article-title":"The exact Tur\u00e1n number of disjoint graphs \u2013 a generalization of Simonovits' theorem, and beyond","volume":"130","author":"Chen","year":"2025","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115232_br0030","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s00373-018-1996-3","article-title":"Spectral extremal results with forbidding linear forests","volume":"35","author":"Chen","year":"2019","journal-title":"Graphs Comb."},{"key":"10.1016\/j.disc.2026.115232_br0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2020.112269","article-title":"On the spectral radius of graphs without a star forest","volume":"344","author":"Chen","year":"2021","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115232_br0050","article-title":"The spectral even cycle problem","volume":"4","author":"Cioab\u0103","year":"2024","journal-title":"Comb. Theory"},{"key":"10.1016\/j.disc.2026.115232_br0060","series-title":"An Introduction to the Theory of Graph Spectra","author":"Cvetkovi\u0107","year":"2010"},{"key":"10.1016\/j.disc.2026.115232_br0070","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1006\/jctb.1999.1926","article-title":"The spectral radius of graphs on surfaces","volume":"78","author":"Ellingham","year":"2000","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115232_br0080","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/BF01650069","article-title":"\u00dcber ein Extremal problem in der Graphentheorie","volume":"13","author":"Erd\u0151s","year":"1962","journal-title":"Arch. Math."},{"key":"10.1016\/j.disc.2026.115232_br0090","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","article-title":"On maximal paths and circuits of graphs","volume":"10","author":"Erd\u0151s","year":"1959","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"10.1016\/j.disc.2026.115232_br0100","article-title":"Spectral extremal problem on t copies of \u2113-cycles","volume":"31","author":"Fang","year":"2024","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.disc.2026.115232_br0110","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.laa.2006.09.014","article-title":"Spectral radius of graphs with given matching number","volume":"422","author":"Feng","year":"2007","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.disc.2026.115232_br0120","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/s00373-010-0999-5","article-title":"Tur\u00e1n numbers for disjoint copies of graphs","volume":"27","author":"Gorgol","year":"2011","journal-title":"Graphs Comb."},{"key":"10.1016\/j.disc.2026.115232_br0130","series-title":"Matrix Analysis","author":"Horn","year":"1985"},{"key":"10.1016\/j.disc.2026.115232_br0140","article-title":"Spectral extremal problem on disjoint color-critical graphs","volume":"31","author":"Lei","year":"2024","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.disc.2026.115232_br0150","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.laa.2025.01.034","article-title":"Spectral extremal graphs for disjoint odd wheels","volume":"710","author":"Luo","year":"2025","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.disc.2026.115232_br0160","first-page":"60","article-title":"Problem 28","volume":"10","author":"Mantel","year":"1907","journal-title":"Wiskd. Opg."},{"key":"10.1016\/j.disc.2026.115232_br0170","doi-asserted-by":"crossref","first-page":"95","DOI":"10.4153\/CJM-1968-012-x","article-title":"On independent complete subgraphs in a graph","volume":"20","author":"Moon","year":"1968","journal-title":"Can. J. Math."},{"key":"10.1016\/j.disc.2026.115232_br0180","article-title":"Spectral extremal graphs for disjoint cliques","volume":"30","author":"Ni","year":"2023","journal-title":"Electron. J. Comb."},{"issue":"2\u20133","key":"10.1016\/j.disc.2026.115232_br0190","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.laa.2007.07.010","article-title":"Bounds on graph eigenvalues II","volume":"427","author":"Nikiforov","year":"2007","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.disc.2026.115232_br0200","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1016\/j.laa.2007.09.029","article-title":"A spectral condition for odd cycles in graphs","volume":"428","author":"Nikiforov","year":"2008","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.disc.2026.115232_br0210","doi-asserted-by":"crossref","first-page":"2243","DOI":"10.1016\/j.laa.2009.05.023","article-title":"The spectral radius of graphs without paths and cycles of specified length","volume":"432","author":"Nikiforov","year":"2010","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.disc.2026.115232_br0220","series-title":"Theory of Graphs","first-page":"279","article-title":"A method for solving extremal problems in graph theory, stability problems","author":"Simonovits","year":"1968"},{"key":"10.1016\/j.disc.2026.115232_br0230","first-page":"436","article-title":"On an extremal problem in graph theory","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Mat. Fiz. Lapok"},{"key":"10.1016\/j.disc.2026.115232_br0240","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.disc.2016.08.004","article-title":"The Tur\u00e1n number of disjoint copies of paths","volume":"340","author":"Yuan","year":"2017","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115232_br0250","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1016\/j.laa.2012.05.006","article-title":"Proof of a conjecture on the spectral radius of C4-free graphs","volume":"437","author":"Zhai","year":"2012","journal-title":"Linear Algebra Appl."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26002566?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26002566?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T16:29:32Z","timestamp":1783182572000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26002566"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":25,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["S0012365X26002566"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115232","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The maximum spectral radius of k\u202f\u22c5\u202fP3-free graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115232","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":"115232"}}