{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T14:53:21Z","timestamp":1769525601438,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T00:00:00Z","timestamp":1747958400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T00:00:00Z","timestamp":1747958400000},"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":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s40314-025-03257-0","type":"journal-article","created":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T01:20:38Z","timestamp":1747963238000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The maximum spectral radius of graphs of even size forbidding {H(3,\u00a03),\u00a0H(4,\u00a03)}"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1137-517X","authenticated-orcid":false,"given":"S.","family":"Pirzada","sequence":"first","affiliation":[]},{"given":"Amir","family":"Rehman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,23]]},"reference":[{"issue":"4","key":"3257_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.112269","volume":"344","author":"MZ Chen","year":"2021","unstructured":"Chen MZ, Liu AM, Zhang XD (2021) On the spectral radius of graphs without a star forest. Discrete Math. 344(4):112269","journal-title":"Discrete Math."},{"key":"3257_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2021.103420","volume":"99","author":"S Cioaba","year":"2022","unstructured":"Cioaba S, Desai DN, Tait M (2022) The spectral radius of graphs with no odd wheels. Eur. J. Comb. 99:103420","journal-title":"Eur. J. Comb."},{"key":"3257_CR3","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.laa.2023.02.019","volume":"666","author":"X Fang","year":"2023","unstructured":"Fang X, You L (2023) The maximum spectral radius of graphs of given size with forbidden subgraph. Linear Algebra Appl. 666:114\u2013128","journal-title":"Linear Algebra Appl."},{"key":"3257_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.laa.2018.12.023","volume":"566","author":"J Gao","year":"2019","unstructured":"Gao J, Hou X (2019) The spectral radius of graphs without long cycles. Linear Algebra Appl. 566:17\u201333","journal-title":"Linear Algebra Appl."},{"issue":"12","key":"3257_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113680","volume":"346","author":"Y Li","year":"2023","unstructured":"Li Y, Lu L, Peng Y (2023) Spectral extremal graphs for the bowtie. Discrete Math. 346(12):113680","journal-title":"Discrete Math."},{"issue":"2","key":"3257_CR6","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1017\/S0963548320000462","volume":"30","author":"H Lin","year":"2021","unstructured":"Lin H, Ning B, Wu B (2021) Eigenvalues and triangles in graphs. Combinatorics, Probability Comput. 30(2):258\u2013270","journal-title":"Combinatorics, Probability Comput."},{"key":"3257_CR7","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.laa.2022.01.016","volume":"640","author":"G Min","year":"2022","unstructured":"Min G, Lou Z, Huang Q (2022) A sharp upper bound on the spectral radius of $$C_5$$-free\/$$C_6$$-free graphs with given size. Linear Algebra Appl. 640:162\u2013178","journal-title":"Linear Algebra Appl."},{"key":"3257_CR8","doi-asserted-by":"crossref","unstructured":"Nikiforov V (2011) Some new results in extremal graph theory, Surveys in Combinatorics, Cambridge University Press 141-181","DOI":"10.1017\/CBO9781139004114.005"},{"issue":"7","key":"3257_CR9","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1016\/j.laa.2007.09.029","volume":"428","author":"V Nikiforov","year":"2008","unstructured":"Nikiforov V (2008) A spectral condition for odd cycles in graphs. Linear Algebra Appl. 428(7):1492\u20131498","journal-title":"Linear Algebra Appl."},{"key":"3257_CR10","doi-asserted-by":"publisher","first-page":"2898","DOI":"10.1016\/j.laa.2009.01.002","volume":"430","author":"V Nikiforov","year":"2009","unstructured":"Nikiforov V (2009) The maximum spectral radius of $$C_4$$-free graphs of given order and size. Linear Algebra Appl. 430:2898\u20132905","journal-title":"Linear Algebra Appl."},{"issue":"9","key":"3257_CR11","doi-asserted-by":"publisher","first-page":"2243","DOI":"10.1016\/j.laa.2009.05.023","volume":"432","author":"V Nikiforov","year":"2010","unstructured":"Nikiforov V (2010) The spectral radius of graphs without paths and cycles of specified length. Linear Algebra Appl. 432(9):2243\u20132256","journal-title":"Linear Algebra Appl."},{"key":"3257_CR12","unstructured":"Nosal E (1970) Eigenvalues of graphs, Masters thesis, University of Calgary"},{"key":"3257_CR13","unstructured":"Pirzada S (2012) An Introduction to Graph Theory, Universities Press (OrientBlackSwan)"},{"key":"3257_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.laa.2025.01.023","volume":"709","author":"S Pirzada","year":"2025","unstructured":"Pirzada S, Rehman A (2025) Maximum $$A_\\alpha $$-spectral radius of $$\\{C (3, 3), C (4, 3)\\}$$-free graphs. Linear Algebra Appl. 709:385\u2013396","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"3257_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/09728600.2024.2421212","volume":"22","author":"A Rehman","year":"2024","unstructured":"Rehman A, Pirzada S (2024) The spectral Tur\u00e1n problem graphs of given size with forbidden subgraphs. AKCE Int. J. Graphs Comb. 22(1):91\u201393","journal-title":"AKCE Int. J. Graphs Comb."},{"issue":"1","key":"3257_CR16","doi-asserted-by":"publisher","first-page":"124","DOI":"10.47745\/ausi-2024-0008","volume":"16","author":"A Rehman","year":"2024","unstructured":"Rehman A, Pirzada S (2024) On maximum spectral radius of $$\\{H (3, 3),~ H (4, 3)\\} $$-free graphs, Acta Univ. Sapientiae, Informatica 16(1):124\u2013138","journal-title":"Sapientiae, Informatica"},{"key":"3257_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2021.103322","volume":"95","author":"M Zhai","year":"2021","unstructured":"Zhai M, Lin H, Shu J (2021) Spectral extrema of graphs with fixed size: Cycles and complete bipartite graphs. Eur. J. Comb. 95:103322","journal-title":"Eur. J. Comb."}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03257-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03257-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03257-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T15:17:33Z","timestamp":1757171853000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03257-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,23]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["3257"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03257-0","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,23]]},"assertion":[{"value":"21 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2025","order":4,"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.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"295"}}