{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:16:44Z","timestamp":1757618204531,"version":"3.44.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T00:00:00Z","timestamp":1749168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T00:00:00Z","timestamp":1749168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100014013","name":"UK Research and Innovation","doi-asserted-by":"publisher","award":["EP\/T00729X\/1)"],"award-info":[{"award-number":["EP\/T00729X\/1)"]}],"id":[{"id":"10.13039\/100014013","id-type":"DOI","asserted-by":"publisher"}]}],"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-03269-w","type":"journal-article","created":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T23:08:50Z","timestamp":1749164930000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the maximum spectral radius of clique trees with a given zero forcing number"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1777-120X","authenticated-orcid":false,"given":"Joyentanuj","family":"Das","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,6]]},"reference":[{"key":"3269_CR1","doi-asserted-by":"crossref","unstructured":"AIM Minimum Rank - Special Graphs Work Group (F. Barioli, W. Barrett, S. Butler, S.M. Cioaba, D. Cvetkovi\u0107, S.M. Fallat, C. Godsil, W. Haemers, L. Hogben, R. Mikkelson, S. Narayan, O. Pryporova, I. Sciriha, W. So, D. Stevanovi\u0107, H. van der Holst, K. Vander Meulen, and A. Wangsness). Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl. 428(7) (2008)","DOI":"10.1016\/j.laa.2007.10.009"},{"key":"3269_CR2","unstructured":"Alon N (2008) A propagation process on Cayley graphs"},{"key":"3269_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-6569-9","volume-title":"Graphs and matrices","author":"RB Bapat","year":"2014","unstructured":"Bapat RB (2014) Graphs and matrices, 2nd edn. Hindustan Book Agency, New Delhi","edition":"2"},{"key":"3269_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.laa.2004.06.019","volume":"392","author":"F Barioli","year":"2004","unstructured":"Barioli F, Fallat SM, Hogben L (2004) Computation of minimal rank and path cover number for graphs. Linear Algebra Appl 392:289\u2013303","journal-title":"Linear Algebra Appl"},{"issue":"2","key":"3269_CR5","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.laa.2010.03.008","volume":"433","author":"F Barioli","year":"2010","unstructured":"Barioli F, Barrett W, Fallat SM, Hall HT, Hogben L, Shader B, van den Driessche P, van der Holst H (2010) Zero forcing parameters and minimum rank problems. Linear Algebra Appl 433(2):401\u2013411","journal-title":"Linear Algebra Appl"},{"issue":"2","key":"3269_CR6","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1137\/0607030","volume":"7","author":"RA Brualdi","year":"1986","unstructured":"Brualdi RA, Solheid ES (1986) On the spectral radius of complementary acyclic matrices of zeros and ones. SIAM J Algebraic Discrete Methods 7(2):265\u2013272","journal-title":"SIAM J Algebraic Discrete Methods"},{"key":"3269_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00025-023-02117-9","volume":"79","author":"J Choi","year":"2024","unstructured":"Choi J, Park J (2024) The Minimal Spectral Radius with Given Independence Number. Results Math 79:81","journal-title":"Results Math"},{"key":"3269_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/03081089008818026","volume":"28","author":"D Cvetkovi\u0107","year":"1990","unstructured":"Cvetkovi\u0107 D, Rowlinson P (1990) The largest eigenvalues of a graph: A survey. Linear Multilinear Algebra 28:3\u201333","journal-title":"Linear Multilinear Algebra"},{"key":"3269_CR9","doi-asserted-by":"crossref","unstructured":"Cvetkovi\u0107 D, Rowlinson P, Simi\u0107 S (2009) An introduction to the theory of graph spectra, Cambridge University Press","DOI":"10.1017\/CBO9780511801518"},{"key":"3269_CR10","volume":"402","author":"J Das","year":"2021","unstructured":"Das J, Mohanty S (2021) On the spectral radius of bi-block graphs with given independence number $$\\alpha $$. Appl Math Comput 402:125912","journal-title":"Appl Math Comput"},{"key":"3269_CR11","volume":"465","author":"J Das","year":"2024","unstructured":"Das J, Mohanty S (2024) Maximization of the spectral radius of block graphs with a given dissociation number. Appl Math Comput 465:128424","journal-title":"Appl Math Comput"},{"key":"3269_CR12","first-page":"33","volume":"84","author":"L Feng","year":"2011","unstructured":"Feng L, Yu G (2011) Spectral radius of unicyclic graphs with given independence number. Util Math 84:33\u201343","journal-title":"Util Math"},{"issue":"1","key":"3269_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.laa.2005.08.008","volume":"413","author":"J Guo","year":"2006","unstructured":"Guo J, Shao J (2006) On the spectral radius of trees with fixed diameter. Linear Algebra Appl 413(1):131\u2013147","journal-title":"Linear Algebra Appl"},{"key":"3269_CR14","doi-asserted-by":"publisher","first-page":"2961","DOI":"10.1016\/j.laa.2010.01.001","volume":"432","author":"L Huang","year":"2010","unstructured":"Huang L, Chang GJ, Yeh H (2010) On minimum rank and zero forcing sets of a graph. Linear Algebra Appl 432:2961\u20132973","journal-title":"Linear Algebra Appl"},{"key":"3269_CR15","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.laa.2015.09.030","volume":"488","author":"C Ji","year":"2016","unstructured":"Ji C, Lu M (2016) On the spectral radius of trees with given independence number. Linear Algebra Appl 488:102\u2013108","journal-title":"Linear Algebra Appl"},{"key":"3269_CR16","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.laa.2004.03.026","volume":"389","author":"H Liu","year":"2004","unstructured":"Liu H, Lu M, Tian F (2004) On the spectral radius of graphs with cut edges. Linear Algebra Appl 389:139\u2013145","journal-title":"Linear Algebra Appl"},{"key":"3269_CR17","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.jda.2014.08.006","volume":"31","author":"H Lu","year":"2015","unstructured":"Lu H, Lin Y (2015) Maximum spectral radius of graphs with given connectivity, minimum degree and independence number. J Discrete Algorithms 31:113\u2013119","journal-title":"J Discrete Algorithms"},{"key":"3269_CR18","doi-asserted-by":"crossref","unstructured":"Lou Z, Guo J (2022) The spectral radius of graphs with given independence number, Discrete Math. 345 (4) 112778, 13 pp","DOI":"10.1016\/j.disc.2021.112778"},{"key":"3269_CR19","unstructured":"Stevanovi\u0107 D (2014) Spectral Radius of Graphs, Academic Press"},{"issue":"3\u20134","key":"3269_CR20","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1080\/03081080902722816","volume":"58","author":"J Wu","year":"2010","unstructured":"Wu J, Deng H, Jiang Q (2010) On the spectral radius of cacti with $$k$$-pendant vertices. Linear Multi Alg 58(3\u20134):391\u2013398","journal-title":"Linear Multi Alg"},{"key":"3269_CR21","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.laa.2004.08.025","volume":"395","author":"B Wu","year":"2005","unstructured":"Wu B, Xiao E, Hong Y (2005) The spectral radius of trees on $$k$$ pendant vertices. Linear Algebra Appl 395:343\u2013349","journal-title":"Linear Algebra Appl"},{"issue":"5\u20137","key":"3269_CR22","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/j.laa.2009.03.055","volume":"431","author":"M Xu","year":"2009","unstructured":"Xu M, Hong Y, Shu J, Zhai M (2009) The minimum spectral radius of graphs with a given independence number. Linear Algebra Appl 431(5\u20137):937\u2013945","journal-title":"Linear Algebra Appl"},{"key":"3269_CR23","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"},{"issue":"P1","key":"3269_CR24","first-page":"33","volume":"29","author":"W Zhang","year":"2022","unstructured":"Zhang W, Wang J, Wang W, Ji S (2022) On the Zero Forcing Number and Spectral Radius of Graphs. The Electron J Comb 29(P1):33","journal-title":"The Electron J Comb"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03269-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03269-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03269-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T18:06:46Z","timestamp":1757182006000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03269-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,6]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["3269"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03269-w","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2025,6,6]]},"assertion":[{"value":"8 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 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":"There is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"315"}}