{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:28:08Z","timestamp":1648884488601},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1986,3,1]],"date-time":"1986-03-01T00:00:00Z","timestamp":510019200000},"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":[[1986,3]]},"DOI":"10.1016\/0020-0190(86)90057-8","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"133-134","source":"Crossref","is-referenced-by-count":3,"title":["Nonisomorphic graphs with the same T-polynomial"],"prefix":"10.1016","volume":"22","author":[{"given":"Yoshio","family":"Hattori","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90057-8_BIB1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0020-0190(77)90029-1","article-title":"Nonisomorphic trees with the same T-polynomial","volume":"6","author":"Dinic","year":"1977","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(86)90057-8_BIB2","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(86)90057-8_BIB3","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 extremal number of trees","volume":"16","author":"Kelmans","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0020-0190(86)90057-8_BIB4","article-title":"Properties of the number of spanning trees in a linear graph and a related extremal problem","author":"Hattori","year":"1963"},{"key":"10.1016\/0020-0190(86)90057-8_BIB5","series-title":"Proc. Kyoto Internat. Conf. on Circuit and System Theory","first-page":"27","article-title":"A characteristic polynomial of the linear graph and its application","author":"Hattori","year":"1970"},{"key":"10.1016\/0020-0190(86)90057-8_BIB6","first-page":"608","article-title":"Polynomials of the number of spanning trees in a graph","volume":"J68-A","author":"Hattori","year":"1985","journal-title":"Trans. Institute of Electronics and Communication Engineers of Japan"},{"key":"10.1016\/0020-0190(86)90057-8_BIB7","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/0016-0032(81)90053-3","article-title":"Tree counting polynomials for labelled graphs, Part I: Properties","volume":"312","author":"Bedrosian","year":"1981","journal-title":"J. Franklin Institute"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900578?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900578?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:29:05Z","timestamp":1553592545000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086900578"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,3]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,3]]}},"alternative-id":["0020019086900578"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90057-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,3]]}}}