{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T01:23:54Z","timestamp":1778894634340,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","doi-asserted-by":"publisher","award":["451-03-136\/2025-03\/200104"],"award-info":[{"award-number":["451-03-136\/2025-03\/200104"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271182"],"award-info":[{"award-number":["12271182"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2024A1515011899"],"award-info":[{"award-number":["2024A1515011899"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.disc.2026.115079","type":"journal-article","created":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:36:55Z","timestamp":1772793415000},"page":"115079","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Connected claw-free graphs whose second largest eigenvalue does not exceed 1"],"prefix":"10.1016","volume":"349","author":[{"given":"Chaohui","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiying","family":"Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhuo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4949-4203","authenticated-orcid":false,"given":"Zoran","family":"Stani\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115079_br0010","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1002\/jgt.22708","article-title":"Multiplicity of the second largest eigenvalue of a planar graph","volume":"98","author":"Chen","year":"2021","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115079_br0020","first-page":"15","article-title":"On graphs whose second largest eigenvalue does not exceed 1","volume":"31","author":"Cvetkovi\u0107","year":"1982","journal-title":"Publ. Inst. Math. (Belgr.)"},{"key":"10.1016\/j.disc.2026.115079_br0030","series-title":"An Introduction to the Theory of Graph Spectra","author":"Cvetkovi\u0107","year":"2010"},{"key":"10.1016\/j.disc.2026.115079_br0040","series-title":"Reflection Groups and Coxeter Groups","author":"Humphreys","year":"1990"},{"key":"10.1016\/j.disc.2026.115079_br0050","doi-asserted-by":"crossref","first-page":"729","DOI":"10.4007\/annals.2021.194.3.3","article-title":"Equiangular lines with a fixed angle","volume":"194","author":"Jiang","year":"2021","journal-title":"Ann. Math."},{"key":"10.1016\/j.disc.2026.115079_br0060","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/s00025-023-01883-w","article-title":"Characterization of outerplanar graphs whose second largest eigenvalue is at most 1","volume":"78","author":"Li","year":"2023","journal-title":"Result. Math."},{"key":"10.1016\/j.disc.2026.115079_br0070","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2021.103385","article-title":"On graphs whose second largest eigenvalue is at most 1","volume":"97","author":"Liu","year":"2021","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115079_br0080","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2023.103775","article-title":"Connected (K4\u2212e)-free graphs whose second largest eigenvalue does not exceed 1","volume":"115","author":"Liu","year":"2024","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115079_br0090","article-title":"Graphs with large clique number whose second largest eigenvalue does not exceed (5\u22121)\/2","volume":"32","author":"Liu","year":"2025","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.disc.2026.115079_br0100","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/(SICI)1097-0118(199802)27:2<61::AID-JGT1>3.0.CO;2-D","article-title":"On the second largest eigenvalue of line graphs","volume":"27","author":"Petrovi\u0107","year":"1998","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115079_br0120","series-title":"Inequalities for Graph Eigenvalues","author":"Stani\u0107","year":"2015"},{"key":"10.1016\/j.disc.2026.115079_br0130","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.laa.2023.02.005","article-title":"Graphs with second largest eigenvalue less than 1\/2","volume":"665","author":"Wu","year":"2023","journal-title":"Linear Algebra Appl."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26001032?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26001032?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T21:41:52Z","timestamp":1776116512000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26001032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":12,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["S0012365X26001032"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115079","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Connected claw-free graphs whose second largest eigenvalue does not exceed 1","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115079","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"}],"article-number":"115079"}}