{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:55:13Z","timestamp":1781463313345,"version":"3.54.1"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"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","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,10]]},"DOI":"10.1016\/j.dam.2026.04.039","type":"journal-article","created":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T22:18:14Z","timestamp":1778537894000},"page":"137-145","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Tricyclic graphs with the second largest distance eigenvalue less than \u221212"],"prefix":"10.1016","volume":"391","author":[{"given":"Kexin","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6160-1761","authenticated-orcid":false,"given":"Ligong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.04.039_b1","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/j.laa.2020.05.028","article-title":"On the second largest eigenvalue of the generalized distance matrix of graphs","volume":"603","author":"Alhevaz","year":"2020","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.04.039_b2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.laa.2014.06.010","article-title":"Distance spectra of graphs: a survey","volume":"458","author":"Aouchiche","year":"2014","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.04.039_b3","series-title":"Spectra of Graphs","author":"Brouwer","year":"2012"},{"key":"10.1016\/j.dam.2026.04.039_b4","series-title":"Written on the wall: conjectures derived on the basis of the program galatea gabriella graffiti","author":"Fajtlowicz","year":"1998"},{"key":"10.1016\/j.dam.2026.04.039_b5","doi-asserted-by":"crossref","first-page":"2495","DOI":"10.1002\/j.1538-7305.1971.tb02618.x","article-title":"On the addressing problem for loop switching","volume":"50","author":"Graham","year":"1971","journal-title":"Bell Syst. Tech. J."},{"issue":"9","key":"10.1016\/j.dam.2026.04.039_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.114082","article-title":"Graphs for which the second largest distance eigenvalue is less than \u221212","volume":"347","author":"Guo","year":"2024","journal-title":"Discrete Math."},{"issue":"228","key":"10.1016\/j.dam.2026.04.039_b7","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/0024-3795(95)00199-2","article-title":"Interlacing eigenvalues and graphs","volume":"226","author":"Haemers","year":"1995","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.04.039_b8","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.laa.2015.01.034","article-title":"Proof of a conjecture involving the second largest D-eigenvalue and the number of triangles","volume":"472","author":"Lin","year":"2015","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"10.1016\/j.dam.2026.04.039_b9","first-page":"29","article-title":"A survey on distance spectra of graphs","volume":"50","author":"Lin","year":"2021","journal-title":"Adv. Math. (China)"},{"key":"10.1016\/j.dam.2026.04.039_b10","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1080\/03081087.2016.1221376","article-title":"On the second largest distance eigenvalue of a graph","volume":"65","author":"Liu","year":"2017","journal-title":"Linear Multilinear Algebra"},{"key":"10.1016\/j.dam.2026.04.039_b11","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1002\/jgt.3190140309","article-title":"The distance spectrum of a tree","volume":"14","author":"Merris","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.04.039_b12","doi-asserted-by":"crossref","first-page":"1887","DOI":"10.1080\/03081087.2015.1127317","article-title":"On the second largest distance eigenvalue","volume":"64","author":"Xing","year":"2016","journal-title":"Linear Multilinear Algebra"},{"key":"10.1016\/j.dam.2026.04.039_b13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ipl.2016.11.008","article-title":"On the two largest distance eigenvalues of graph powers","volume":"119","author":"Xing","year":"2017","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.dam.2026.04.039_b14","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.laa.2020.01.014","article-title":"On the second largest distance eigenvalue of a block graph","volume":"591","author":"Xue","year":"2020","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.04.039_b15","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/j.dam.2013.08.045","article-title":"Tricyclic graph with maximal estrada index","volume":"162","author":"Zhu","year":"2014","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002672?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002672?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:08:52Z","timestamp":1781460532000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26002672"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":15,"alternative-id":["S0166218X26002672"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.039","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Tricyclic graphs with the second largest distance eigenvalue less than","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.039","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"}]}}