{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T04:22:07Z","timestamp":1745554927127,"version":"3.40.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T00:00:00Z","timestamp":1737936000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T00:00:00Z","timestamp":1737936000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UIDB\/00297\/2020","UIDP\/00297\/2020"],"award-info":[{"award-number":["UIDB\/00297\/2020","UIDP\/00297\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005855","name":"Universidade Nova de Lisboa","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005855","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv. Oper. Theory"],"published-print":{"date-parts":[[2025,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Our purpose is to identify the graphs that are \u201cfundamental\u201d for the maximum multiplicity problem for Hermitian matrices with a given undirected simple graph. Like paths for trees, these are the special graphs to which the maximum multiplicity problem may be reduced. These are the graphs for which maximum multiplicity implies that all vertices are downers. Examples include cycles and complete graphs, and several more are identified, using the theory developed herein. All the unicyclic graphs that are fundamental, are explicitly identified. We also list those graphs with two edges added to a tree, and their maximum multiplicities, which we have found so far to be fundamental. A formula for maximum multiplicity is given based on fundamental graphs.<\/jats:p>","DOI":"10.1007\/s43036-025-00420-6","type":"journal-article","created":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T20:38:02Z","timestamp":1738010282000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fundamental graphs for the maximum multiplicity of an eigenvalue among Hermitian matrices with a given graph"],"prefix":"10.1007","volume":"10","author":[{"given":"Charles R.","family":"Johnson","sequence":"first","affiliation":[]},{"given":"Ant\u00f3nio","family":"Leal-Duarte","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9843-3821","authenticated-orcid":false,"given":"Carlos M.","family":"Saiago","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,27]]},"reference":[{"key":"420_CR1","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, S., Hogben, L.: Computation of minimal rank and path cover number for graphs. Linear Algebra Appl. 392, 289\u2013303 (2004)","journal-title":"Linear Algebra Appl."},{"key":"420_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.laa.2004.09.014","volume":"409","author":"F Barioli","year":"2005","unstructured":"Barioli, F., Fallat, S., Hogben, L.: On the difference between the maximum multiplicity and path cover number for tree-like graphs. Linear Algebra Appl. 409, 13\u201331 (2005)","journal-title":"Linear Algebra Appl."},{"key":"420_CR3","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1090\/S0025-5718-1980-0583498-3","volume":"35","author":"W Ferguson","year":"1980","unstructured":"Ferguson, W.: The construction of Jacobi and periodic Jacobi matrices with prescribed spectra. Math. Comput. 35, 1203\u20131220 (1980)","journal-title":"Math. Comput."},{"key":"420_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0024-3795(69)90027-5","volume":"2","author":"M Fiedler","year":"1969","unstructured":"Fiedler, M.: A characterization of tridiagonal matrices. Linear Algebra Appl. 2, 191\u2013197 (1969)","journal-title":"Linear Algebra Appl."},{"key":"420_CR5","volume-title":"Matrix Analysis","author":"R Horn","year":"2013","unstructured":"Horn, R., Johnson, C.R.: Matrix Analysis, 2nd Edition Cambridge University Press, New York (2013)","edition":"2nd Edition"},{"key":"420_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/03081089908818608","volume":"46","author":"CR Johnson","year":"1999","unstructured":"Johnson, C.R., Leal-Duarte, A.: The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree. Linear Multilinear Algebra 46, 139\u2013144 (1999)","journal-title":"Linear Multilinear Algebra"},{"key":"420_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.13001\/1081-3810.1070","volume":"9","author":"CR Johnson","year":"2002","unstructured":"Johnson, C.R., Saiago, C.M.: Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix. Electron. J. Linear Algebra 9, 27\u201331 (2002)","journal-title":"Electron. J. Linear Algebra"},{"issue":"23","key":"420_CR8","doi-asserted-by":"publisher","first-page":"3130","DOI":"10.1016\/j.disc.2005.04.026","volume":"306","author":"CR Johnson","year":"2006","unstructured":"Johnson, C.R., Saiago, C.M.: The trees for which maximum multiplicity implies the simplicity of other eigenvalues. Discrete Math. 306(23), 3130\u20133135 (2006)","journal-title":"Discrete Math."},{"key":"420_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/9781316155158","volume-title":"Eigenvalues, Multiplicities and Graphs","author":"CR Johnson","year":"2018","unstructured":"Johnson, C.R., Saiago, C.M.: Eigenvalues, Multiplicities and Graphs. Cambridge University Press, Cambridge (2018)"},{"issue":"2","key":"420_CR10","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1137\/S0895479801393320","volume":"25","author":"CR Johnson","year":"2003","unstructured":"Johnson, C.R., Leal-Duarte, A., Saiago, C.M.: The Parter\u2013Weiner theorem: refinement and generalization. SIAM J. Matrix Anal. Appl. 25(2), 352\u2013361 (2003)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"420_CR11","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.laa.2008.04.016","volume":"429","author":"CR Johnson","year":"2008","unstructured":"Johnson, C.R., Leal-Duarte, A., Saiago, C.M.: The structure of matrices with a maximum multiplicity eigenvalue. Linear Algebra Appl. 429(4), 875\u2013886 (2008)","journal-title":"Linear Algebra Appl."},{"issue":"7","key":"420_CR12","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1080\/01445340802354580","volume":"57","author":"CR Johnson","year":"2009","unstructured":"Johnson, C.R., Loewy, R., Smith, P.A.: The graphs for which the maximum multiplicity of an eigenvalue is two. Linear Multilinear Algebra 57(7), 713\u2013736 (2009)","journal-title":"Linear Multilinear Algebra"},{"issue":"5","key":"420_CR13","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1080\/03081087.2011.610973","volume":"60","author":"CR Johnson","year":"2012","unstructured":"Johnson, C.R., Leal-Duarte, A., Saiago, C.M.: The change in eigenvalue multiplicity associated with perturbation of a diagonal entry. Linear Multilinear Algebra 60(5), 525\u2013532 (2012)","journal-title":"Linear Multilinear Algebra"},{"key":"420_CR14","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0024-3795(95)00238-3","volume":"248","author":"P Nylen","year":"1996","unstructured":"Nylen, P.: Minimum-rank matrices with prescribed graph. Linear Algebra Appl. 248, 303\u2013316 (1996)","journal-title":"Linear Algebra Appl."},{"key":"420_CR15","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1137\/0108024","volume":"8","author":"S Parter","year":"1960","unstructured":"Parter, S.: On the eigenvalues and eigenvectors of a class of matrices. J. Soc. Ind. Appl. Math. 8, 376\u2013388 (1960)","journal-title":"J. Soc. Ind. Appl. Math."}],"container-title":["Advances in Operator Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43036-025-00420-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43036-025-00420-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43036-025-00420-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T17:40:35Z","timestamp":1745516435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43036-025-00420-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,27]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["420"],"URL":"https:\/\/doi.org\/10.1007\/s43036-025-00420-6","relation":{},"ISSN":["2662-2009","2538-225X"],"issn-type":[{"type":"print","value":"2662-2009"},{"type":"electronic","value":"2538-225X"}],"subject":[],"published":{"date-parts":[[2025,1,27]]},"assertion":[{"value":"30 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"30"}}