{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T16:13:05Z","timestamp":1696695185197},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1977,6,1]],"date-time":"1977-06-01T00:00:00Z","timestamp":233971200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1977,6]]},"DOI":"10.1016\/0020-0190(77)90029-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"73-76","source":"Crossref","is-referenced-by-count":9,"title":["Nonisomorphic trees with the same T-polynomial"],"prefix":"10.1016","volume":"6","author":[{"given":"E.A.","family":"Dinic","sequence":"first","affiliation":[]},{"given":"A.K.","family":"Kelmans","sequence":"additional","affiliation":[]},{"given":"M.A.","family":"Zaitsev","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(77)90029-1_BIB1","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0020-0190(77)90029-1_BIB2_1","first-page":"2194","article-title":"The number of trees in a graph. 1","volume":"26","author":"Kelmans","year":"1965","journal-title":"Avtomat. i Telmeh."},{"key":"10.1016\/0020-0190(77)90029-1_BIB2_2","first-page":"56","article-title":"The number of trees in a graph. ll","volume":"27","author":"Kelmans","year":"1966","journal-title":"Avtomat. i Telmeh."},{"key":"10.1016\/0020-0190(77)90029-1_BIB3","article-title":"On properties of the characteristic polynomial of a graph","volume":"4","author":"Kelmans","year":"1967"},{"key":"10.1016\/0020-0190(77)90029-1_BIB4","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0095-8956(74)90065-3","article-title":"A certain polynomial of a graph and graphs with an external number of trees","volume":"B16","author":"Kelmans","year":"1974","journal-title":"J. Combinatorial Theory Ser."},{"key":"10.1016\/0020-0190(77)90029-1_BIB5","first-page":"1","article-title":"Graphs and their spectra","volume":"354\u2013356","author":"Cvetkovic","year":"1971","journal-title":"Publ. Electrotechn. Fak. Univ. Belgrado., Ser. Mat. i Fiz."},{"key":"10.1016\/0020-0190(77)90029-1_BIB6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0095-8956(72)90023-8","article-title":"The Characteristic polynomial of a graph","volume":"B12","author":"Mowshowitz","year":"1972","journal-title":"J. Combinatorial Theory Ser."},{"key":"10.1016\/0020-0190(77)90029-1_BIB7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0012-365X(76)90102-3","article-title":"Comparison of graphs by their number of spanning trees","volume":"16","author":"Kelmans","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0020-0190(77)90029-1_BIB8","first-page":"121","article-title":"The algorithm of nonisomorphic tree generation","volume":"4","author":"Dinic","year":"1977","journal-title":"Avtomat. i Telemeh."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019077900291?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019077900291?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:26:12Z","timestamp":1555071972000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019077900291"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,6]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1977,6]]}},"alternative-id":["0020019077900291"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(77)90029-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1977,6]]}}}