{"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":1778894634150,"version":"3.51.4"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8113,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1016\/0095-8956(91)90096-3","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T14:32:55Z","timestamp":1094653975000},"page":"102-112","source":"Crossref","is-referenced-by-count":28,"title":["On graphs with exactly one eigenvalue less than \u22121"],"prefix":"10.1016","volume":"52","author":[{"given":"Miroslav","family":"Petrovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 45","key":"10.1016\/0095-8956(91)90096-3_BIB1","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. (Beograd)"},{"key":"10.1016\/0095-8956(91)90096-3_BIB2","author":"Cvetkovi\u0107","year":"1988"},{"key":"10.1016\/0095-8956(91)90096-3_BIB3","series-title":"Recent Trends in Graph Theory","first-page":"181","article-title":"On subdominantly bounded graph-summary of results","volume":"Vol. 186","author":"Howes","year":"1971"},{"key":"10.1016\/0095-8956(91)90096-3_BIB4","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF02579296","article-title":"Discrete hyperbolic geometry","volume":"3","author":"Neumaier","year":"1983","journal-title":"Combinatorica"},{"issue":"No. 735\u2013No. 762","key":"10.1016\/0095-8956(91)90096-3_BIB5_1","article-title":"Graphs whose second least negative eigenvalue is greater than \u22121","author":"Torga\u0161ev","year":"1982","journal-title":"Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz."},{"issue":"No. 759","key":"10.1016\/0095-8956(91)90096-3_BIB5_2","first-page":"148","article-title":"Graphs whose second least negative eigenvalue is greater than \u22121","author":"Torga\u0161ev","year":"1982","journal-title":"Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895691900963?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895691900963?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T03:20:16Z","timestamp":1549250416000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895691900963"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["0095895691900963"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(91)90096-3","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}