{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T14:16:42Z","timestamp":1777299402076,"version":"3.51.4"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"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":["12071411"],"award-info":[{"award-number":["12071411"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171222"],"award-info":[{"award-number":["12171222"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.dam.2026.03.032","type":"journal-article","created":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T12:52:32Z","timestamp":1775307152000},"page":"162-173","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Maximizing the spectral radius of minimally connected graphs with size\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" id=\"d1e363\" altimg=\"si22.svg\">\n                      <mml:mi>m<\/mml:mi>\n                    <\/mml:math>\n                    and no 2-clique cutsets"],"prefix":"10.1016","volume":"388","author":[{"given":"Shu-Guang","family":"Guo","sequence":"first","affiliation":[]},{"given":"Rong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.dam.2026.03.032_b1","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1002\/jgt.22428","article-title":"Clique-cutsets beyond chordal graphs","volume":"91","author":"Boncompagni","year":"2019","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.03.032_b2","series-title":"Graph Theory","author":"Bondy","year":"2008"},{"key":"10.1016\/j.dam.2026.03.032_b3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0024-3795(85)90092-8","article-title":"On the spectral radius of (0,1)-matrices","volume":"65","author":"Brualdi","year":"1985","journal-title":"Linear Algebra Appl."},{"issue":"7","key":"10.1016\/j.dam.2026.03.032_b4","doi-asserted-by":"crossref","first-page":"2092","DOI":"10.1016\/j.disc.2019.04.002","article-title":"On minimally 2-(edge)-connected graphs with extremal spectral radius","volume":"342","author":"Chen","year":"2019","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.03.032_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2025.114528","article-title":"Brualdi-Hoffman-Tur\u00e1n problem of the gem","volume":"348","author":"Chen","year":"2025","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.03.032_b6","series-title":"An Introduction to the Theory of Graph Spectra","author":"Cvetkovi\u0107","year":"2010"},{"key":"10.1016\/j.dam.2026.03.032_b7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","article-title":"On rigid circuit graphs","volume":"25","author":"Dirac","year":"1961","journal-title":"Abh. Math. Semin. Univ. Hambg."},{"key":"10.1016\/j.dam.2026.03.032_b8","first-page":"204","article-title":"Minimally 2-connected graphs","volume":"228","author":"Dirac","year":"1967","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/j.dam.2026.03.032_b9","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.dam.2021.09.002","article-title":"On the (signless Laplacian) spectral radius of minimally k-(edge)-connected graphs for small k","volume":"305","author":"Fan","year":"2021","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.032_b10","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.dam.2022.06.013","article-title":"Sharp upper bounds on the Q-index of (minimally) 2-connected graphs with given size","volume":"320","author":"Guo","year":"2022","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.032_b11","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.dam.2023.08.013","article-title":"Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size","volume":"341","author":"Guo","year":"2023","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.032_b12","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.laa.2025.07.004","article-title":"Sharp upper bounds on the second largest signless Laplacian eigenvalues of connected graphs","volume":"725","author":"Guo","year":"2025","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.03.032_b13","series-title":"Recent Advances in Graph Theory","first-page":"273","article-title":"On the spectral radii of topologically equivalent graphs","author":"Hoffman","year":"1975"},{"issue":"3","key":"10.1016\/j.dam.2026.03.032_b14","doi-asserted-by":"crossref","first-page":"791","DOI":"10.7151\/dmgt.2552","article-title":"The structure of 2-matching connected graphs","volume":"45","author":"Li","year":"2025","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2026.03.032_b15","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1016\/j.dam.2025.08.059","article-title":"A characterization of minimally connected graphs without 2-clique cutsets","volume":"378","author":"Li","year":"2026","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.032_b16","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2024.103966","article-title":"A Brualdi-Hoffman-Tur\u00e1n problem on cycles","volume":"120","author":"Li","year":"2024","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2026.03.032_b17","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1002\/jgt.23287","article-title":"Spectral extrema of graphs with fixed size: forbidden fan graph, friendship graph or theta graph","volume":"100","author":"Li","year":"2025","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.03.032_b18","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.laa.2024.02.026","article-title":"Spectral radius of graphs of given size with forbidden subgraphs","volume":"689","author":"Liu","year":"2024","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.03.032_b19","doi-asserted-by":"crossref","DOI":"10.37236\/12747","article-title":"A max-min problem on spectral radius and connectedness of graphs","volume":"32","author":"Lou","year":"2025","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2026.03.032_b20","doi-asserted-by":"crossref","DOI":"10.37236\/11219","article-title":"On the spectral radius of minimally 2-(edge)-connected graphs with given size","volume":"30","author":"Lou","year":"2023","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2026.03.032_b21","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1017\/S0963548301004928","article-title":"Some inequalities for the largest eigenvalue of a graph","volume":"11","author":"Nikiforov","year":"2002","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.dam.2026.03.032_b22","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1016\/j.jctb.2009.01.003","article-title":"More spectral bounds on the clique and independence","volume":"99","author":"Nikiforov","year":"2009","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.03.032_b23","series-title":"Eigenvalues of Graphs","author":"Nosal","year":"1970"},{"issue":"1","key":"10.1016\/j.dam.2026.03.032_b24","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1090\/S0002-9947-1968-0228369-8","article-title":"On minimal blocks","volume":"134","author":"Plummer","year":"1968","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.dam.2026.03.032_b25","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0024-3795(83)90131-3","article-title":"On the maximal index of graphs with a prescribed number of edges","volume":"110","author":"Rowlinson","year":"1988","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.03.032_b26","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.laa.2004.08.025","article-title":"The spectral radius of trees on k pendant vertices","volume":"395","author":"Wu","year":"2005","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.03.032_b27","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.114391","article-title":"Spectral extremal graphs for fan graphs","volume":"348","author":"Yu","year":"2025","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.03.032_b28","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2021.103322","article-title":"Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs","volume":"95","author":"Zhai","year":"2021","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2026.03.032_b29","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2021.112630","article-title":"A spectral version of mantel\u2019s theorem","volume":"345","author":"Zhai","year":"2022","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.03.032_b30","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.laa.2025.07.032","article-title":"Maximizing the spectral radius of graphs of given size with a forbidden subgraph","volume":"727","author":"Zhang","year":"2025","journal-title":"Linear Algebra Appl."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001745?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001745?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T13:27:33Z","timestamp":1777296453000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26001745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":30,"alternative-id":["S0166218X26001745"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.032","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Maximizing the spectral radius of minimally connected graphs with size  and no 2-clique cutsets","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.032","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"}]}}