{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:40:13Z","timestamp":1649029213841},"reference-count":4,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"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":6316,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1996,4]]},"DOI":"10.1016\/0012-365x(95)00179-z","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"103-113","source":"Crossref","is-referenced-by-count":1,"title":["Graph spectra"],"prefix":"10.1016","volume":"150","author":[{"given":"R.J.","family":"Faudree","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.J.","family":"Gould","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.S.","family":"Jacobson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Lehel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.M.","family":"Lesniak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00179-Z_BIB1","series-title":"Graph Theory, Combinatorics and Algorithms: Proc. 7th Quadrenniel Conf. on the Theory and Applications of Graphs","first-page":"377","article-title":"The k-spectrum of a graph","author":"Erd\u00f6s","year":"1995"},{"key":"10.1016\/0012-365X(95)00179-Z_BIB2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0095-8956(86)90028-6","article-title":"Maximum induced trees in graphs","volume":"41","author":"Erd\u00f6s","year":"1986","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00179-Z_BIB3","unstructured":"P. Erd\u00f6s and J. Spencer, personal communication."},{"key":"10.1016\/0012-365X(95)00179-Z_BIB4","series-title":"An Introduction to the Theory of Numbers","author":"Niven","year":"1980"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500179Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500179Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:23:27Z","timestamp":1556130207000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500179Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":4,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0012365X9500179Z"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00179-z","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}