{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T07:52:22Z","timestamp":1768549942909,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T00:00:00Z","timestamp":1686960000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T00:00:00Z","timestamp":1686960000000},"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":[[2023,7]]},"DOI":"10.1007\/s40314-023-02350-6","type":"journal-article","created":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T17:01:36Z","timestamp":1687021296000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An explicit formula for the distance characteristic polynomial of threshold graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Jo\u00e3o","family":"Lazzarin","sequence":"first","affiliation":[]},{"given":"Oscar F.","family":"M\u00e1rquez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5423-7191","authenticated-orcid":false,"given":"Fernando C.","family":"Tura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,17]]},"reference":[{"key":"2350_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.laa.2014.06.010","volume":"458","author":"M Aouchiche","year":"2014","unstructured":"Aouchiche M, Hansen P (2014) Distance spectra of graphs: a survey. Linear Algebra Appl 458:301\u2013386","journal-title":"Linear Algebra Appl"},{"key":"2350_CR2","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1021\/ci00004a014","volume":"31","author":"AT Balaban","year":"1991","unstructured":"Balaban AT, Ciubotariu D, Medeleanu M (1991) Topological indices and real number vertex invariants based on graph eigenvalues and eigenvectors. J Chem Inf Comput Sci 31:517\u2013523","journal-title":"J Chem Inf Comput Sci"},{"key":"2350_CR3","doi-asserted-by":"publisher","first-page":"3008","DOI":"10.1016\/j.laa.2013.08.007","volume":"439","author":"RB Bapat","year":"2013","unstructured":"Bapat RB (2013) On the adjacency matrix of a threshold graph. Linear Algebra Appl 439:3008\u20133015","journal-title":"Linear Algebra Appl"},{"key":"2350_CR4","series-title":"Ann. discrete math.","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","volume-title":"Studies in integer programming","author":"V Chv\u00e1tal","year":"1977","unstructured":"Chv\u00e1tal V, Hammer PL (1977) Aggregation of inequalities in integer programming. In: Hammer PL et al (eds) Studies in integer programming, vol 1. Ann. discrete math. North-Holland, Amsterdam, pp 145\u2013162"},{"issue":"3","key":"2350_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1010767517079","volume":"66","author":"AA Dobrynin","year":"2001","unstructured":"Dobrynin AA, Entringer R, Gutman I (2001) Wiener index of trees: theory and applications. Acta Appl Math 66(3):211\u2013249","journal-title":"Acta Appl Math"},{"key":"2350_CR6","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1137\/15M1013262","volume":"37","author":"E Fritscher","year":"2016","unstructured":"Fritscher E, Trevisan V (2016) Exploring symmetries to decompose matrices and graphs preserving the spectrum. SIAM J Matrix Anal Appl 37:260\u2013289","journal-title":"SIAM J Matrix Anal Appl"},{"key":"2350_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2016.07.013","volume":"657","author":"M F\u00fcrer","year":"2017","unstructured":"F\u00fcrer M (2017) Efficient computation of the characteristic polynomial of a threshold graph. Theor Comput Sci 657:3\u201310","journal-title":"Theor Comput Sci"},{"key":"2350_CR8","doi-asserted-by":"publisher","first-page":"2495","DOI":"10.1002\/j.1538-7305.1971.tb02618.x","volume":"50","author":"RL Graham","year":"1971","unstructured":"Graham RL, Pollak HO (1971) On the addressing problem for loop switching. Bell Syst Tech J 50:2495\u20132519","journal-title":"Bell Syst Tech J"},{"key":"2350_CR9","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1137\/0206008","volume":"6","author":"PB Henderson","year":"1977","unstructured":"Henderson PB, Zalcstein Y (1977) A graph-theoretic characterization of the PV class of synchronizing primitives. SIAM J Comput 6:88\u2013108","journal-title":"SIAM J Comput"},{"key":"2350_CR10","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF02189621","volume":"25","author":"CD Godsil","year":"1982","unstructured":"Godsil CD, McKay BD (1982) Constructing cospectral graphs. Aequation Math 25:257\u2013268","journal-title":"Aequation Math"},{"key":"2350_CR11","doi-asserted-by":"publisher","first-page":"93","DOI":"10.26493\/1855-3974.103.e09","volume":"2","author":"G Indulal","year":"2009","unstructured":"Indulal G (2009) Distance spectrum of graph compositions. ARS Math Contemp 2:93\u2013100","journal-title":"ARS Math Contemp"},{"key":"2350_CR12","doi-asserted-by":"publisher","first-page":"2762","DOI":"10.1016\/j.laa.2013.07.030","volume":"439","author":"DP Jacobs","year":"2013","unstructured":"Jacobs DP, Trevisan V, Tura F (2013) Eigenvalue location in threshold graphs. Linear Algebra Appl 439:2762\u20132773","journal-title":"Linear Algebra Appl"},{"key":"2350_CR13","doi-asserted-by":"publisher","first-page":"709","DOI":"10.7155\/jgaa.00342","volume":"18","author":"DP Jacobs","year":"2014","unstructured":"Jacobs DP, Trevisan V, Tura F (2014) Computing the characteristic polynomial of threshold graphs. J Graph Algor Appl 18:709\u2013719","journal-title":"J Graph Algor Appl"},{"key":"2350_CR14","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.laa.2014.09.043","volume":"465","author":"DP Jacobs","year":"2015","unstructured":"Jacobs DP, Trevisan V, Tura F (2015) Eigenvalues and energy in threshold graphs. Linear Algebra Appl 465:412\u2013425","journal-title":"Linear Algebra Appl"},{"key":"2350_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.laa.2018.09.033","volume":"560","author":"J Lazzarin","year":"2019","unstructured":"Lazzarin J, M\u00e1rquez OF, Tura FC (2019) No threshold graphs are cospectral. Linear Algebra Appl 560:133\u2013145","journal-title":"Linear Algebra Appl"},{"key":"2350_CR16","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.laa.2018.05.014","volume":"553","author":"L Lu","year":"2018","unstructured":"Lu L, Huang VQ, Lou Z (2018) On the distance spectra of threshold graphs. Linear Algebra Appl 553:223\u2013237","journal-title":"Linear Algebra Appl"},{"key":"2350_CR17","volume-title":"Threshold graphs and related topics","author":"NVR Mahadev","year":"1995","unstructured":"Mahadev NVR, Peled UN (1995) Threshold graphs and related topics. Elsevier, Amsterdam"},{"key":"2350_CR18","first-page":"219","volume":"3","author":"BD Mckay","year":"1977","unstructured":"Mckay BD (1977) On the spectral characterization of trees. ARS Combin 3:219\u2013232","journal-title":"ARS Combin"},{"key":"2350_CR20","unstructured":"Schwenk AJ (1973) Almost all trees are cospectral. In: New directions in the theory of graphs. Proc. Third Ann Arbor Conf., Univ. Michigan, Ann Arbor, Mich., 1971. Academic Press, New York , pp 275\u2013307"},{"key":"2350_CR21","doi-asserted-by":"publisher","DOI":"10.5402\/2011\/108509","author":"I Sciriha","year":"2011","unstructured":"Sciriha I, Farrugia S (2011) On the spectrum of threshold graphs. ISRN Discr Math. https:\/\/doi.org\/10.5402\/2011\/108509","journal-title":"ISRN Discr Math"},{"key":"2350_CR22","doi-asserted-by":"publisher","first-page":"2361","DOI":"10.1016\/j.laa.2009.06.043","volume":"432","author":"SK Simi\u0107","year":"2010","unstructured":"Simi\u0107 SK, Belardo F, Li Marzi EM, Tosi\u0107 DV (2010) Connected graph of fixed order and size with maximal index: some spectral bounds. Linear Algebra Appl 432:2361\u20132372","journal-title":"Linear Algebra Appl"},{"key":"2350_CR19","doi-asserted-by":"publisher","first-page":"2200","DOI":"10.1016\/j.laa.2008.11.026","volume":"430","author":"Z Stani\u0107","year":"2009","unstructured":"Stani\u0107 Z (2009) On nested split graphs whose second largest eigenvalue is less than 1. Linear Algebra Appl 430:2200\u20132211","journal-title":"Linear Algebra Appl"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02350-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-023-02350-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02350-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T09:04:00Z","timestamp":1688979840000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-023-02350-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,17]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["2350"],"URL":"https:\/\/doi.org\/10.1007\/s40314-023-02350-6","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,17]]},"assertion":[{"value":"1 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No potential conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"218"}}