{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T09:30:17Z","timestamp":1748856617926,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T00:00:00Z","timestamp":1707177600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T00:00:00Z","timestamp":1707177600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS 1916439"],"award-info":[{"award-number":["DMS 1916439"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN 2019 03934"],"award-info":[{"award-number":["RGPIN 2019 03934"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s00373-023-02745-6","type":"journal-article","created":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T02:02:32Z","timestamp":1707184952000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5372-6292","authenticated-orcid":false,"given":"Sarah","family":"Allred","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5393-8308","authenticated-orcid":false,"given":"Emelie","family":"Curl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7185-7357","authenticated-orcid":false,"given":"Shaun","family":"Fallat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7093-0479","authenticated-orcid":false,"given":"Shahla","family":"Nasserasr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4806-6837","authenticated-orcid":false,"given":"Houston","family":"Schuerger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3705-6182","authenticated-orcid":false,"given":"Ralihe R.","family":"Villagr\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7502-1381","authenticated-orcid":false,"given":"Prateek K.","family":"Vishwakarma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,6]]},"reference":[{"key":"2745_CR1","doi-asserted-by":"publisher","first-page":"673","DOI":"10.13001\/1081-3810.1679","volume":"26","author":"B Ahmadi","year":"2013","unstructured":"Ahmadi, B., Alinaghipour, F., Cavers, M.S., Fallat, S.M., Meagher, K., Nasserasr, S.: Minimum number of distinct eigenvalues of graphs. Electron. J. Linear Algebra 26, 673\u2013691 (2013)","journal-title":"Electron. J. Linear Algebra"},{"key":"2745_CR2","doi-asserted-by":"publisher","first-page":"316","DOI":"10.13001\/ela.2021.5005","volume":"37","author":"J Ahn","year":"2021","unstructured":"Ahn, J., Alar, C., Bjorkman, B., Butler, S., Carlson, J., Goodnight, A., Knox, H., Monroe, C., Wigal, M.C.: Ordered multiplicity inverse eigenvalue problem for graphs on six vertices. Electron. J. Linear Algebra 37, 316\u2013358 (2021)","journal-title":"Electron. J. Linear Algebra"},{"key":"2745_CR3","first-page":"101","volume":"26","author":"VI Arnol\u2019d","year":"1971","unstructured":"Arnol\u2019d, V.I.: On matrices depending on parameters (Russian). Uspehi Mat. Nauk. 26, 101\u2013114 (1971). (English translation in Russ. Math. Surv. 26, 29\u201343 (1971))","journal-title":"Uspehi Mat. Nauk."},{"issue":"2","key":"2745_CR4","first-page":"1","volume":"24","author":"W Barrett","year":"2017","unstructured":"Barrett, W., Fallat, S., Hall, H.T., Hogben, L., Lin, J.C.-H., Shader, B.L.: Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph. Electron. J. Comb. 24(2), 1\u201328 (2017)","journal-title":"Electron. J. Comb."},{"key":"2745_CR5","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.jctb.2019.10.005","volume":"142","author":"W Barrett","year":"2020","unstructured":"Barrett, W., Butler, S., Fallat, S.M., Hall, H.T., Hogben, L., Lin, J.C.-H., Shader, B.L., Young, M.: The inverse eigenvalue problem of a graph: multiplicities and minors. J. Comb. Theory Ser. B 142, 276\u2013306 (2020)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2745_CR6","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.laa.2022.04.009","volume":"648","author":"S Fallat","year":"2022","unstructured":"Fallat, S., Hall, H.T., Lin, J.C.-H., Shader, B.: The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph. Linear Algebra Appl. 648, 70\u201387 (2022)","journal-title":"Linear Algebra Appl."},{"key":"2745_CR7","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1016\/j.laa.2007.05.036","volume":"426","author":"S Fallat","year":"2007","unstructured":"Fallat, S., Hogben, L.: The minimum rank of symmetric matrices described by a graph: a survey. Linear Algebra Appl. 426, 558\u2013582 (2007)","journal-title":"Linear Algebra Appl."},{"unstructured":"Fallat, S., Hogben, L.: Minimum rank, maximum nullity, and zero forcing number of graphs. In: Hogben, L. (ed.) Handbook of Linear Algebra, 2nd edn, pp. 46-1\u201346-36. CRC Press, Boca Raton (2014)","key":"2745_CR8"},{"key":"2745_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.dam.2018.05.002","volume":"250","author":"CC Fast","year":"2018","unstructured":"Fast, C.C., Hicks, I.V.: Effects of vertex degrees on the zero-forcing number and propagation time of a graph. Discrete Appl. Math. 250, 215\u2013226 (2018)","journal-title":"Discrete Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Hogben, L., Lin, J.C.-H., Shader, B.L.: Inverse Problems and Zero Forcing for Graphs. Mathematical Surveys and Monographs. American Mathematical Society (2022)","key":"2745_CR10","DOI":"10.1090\/surv\/270"},{"key":"2745_CR11","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.laa.2018.12.001","volume":"564","author":"RH Levene","year":"2019","unstructured":"Levene, R.H., Oblak, P., \u0160migoc, H.: A Nordhaus\u2013Gaddum conjecture for the minimum number of distinct eigenvalues of a graph. Linear Algebra Appl. 564, 236\u2013263 (2019)","journal-title":"Linear Algebra Appl."},{"key":"2745_CR12","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.laa.2020.03.031","volume":"598","author":"JC-H Lin","year":"2020","unstructured":"Lin, J.C.-H., Oblak, P., \u0160migoc, H.: The strong spectral property for graphs. Linear Algebra Appl. 598, 68\u201391 (2020)","journal-title":"Linear Algebra Appl."},{"key":"2745_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0095-8956(90)90093-F","volume":"50","author":"YC de Verdi\u00e8re","year":"1990","unstructured":"de Verdi\u00e8re, Y.C.: Sur un nouvel invariant des graphes et un crit\u00e8re de planarit\u00e9. J. Comb. Theory Ser. B 50, 11\u201321 (1990)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2745_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1090\/conm\/147\/01168","volume":"147","author":"YC de Verdi\u00e8re","year":"1993","unstructured":"de Verdi\u00e8re, Y.C.: On a new graph invariant and a criterion for planarity. Graph Struct. Theory 147, 137 (1993)","journal-title":"Graph Struct. Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02745-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02745-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02745-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T18:02:28Z","timestamp":1714240948000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02745-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["2745"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02745-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,2,6]]},"assertion":[{"value":"28 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2024","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":"Conflict of interest"}}],"article-number":"20"}}