{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T20:26:33Z","timestamp":1648844793755},"reference-count":10,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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":6194,"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,8]]},"DOI":"10.1016\/0012-365x(94)00389-z","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"247-258","source":"Crossref","is-referenced-by-count":0,"title":["On numbers of vertices of maximum degree in the spanning trees of a graph"],"prefix":"10.1016","volume":"155","author":[{"given":"Jerzy","family":"Topp","sequence":"first","affiliation":[]},{"given":"Preben D.","family":"Vestergaard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00389-Z_BIB1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0012-365X(84)90061-X","article-title":"Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size","volume":"49","author":"Barefoot","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00389-Z_BIB2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1109\/TCS.1983.1085385","article-title":"Interpolation theorem for diameters of spanning trees","author":"Harary","year":"1983","journal-title":"IEEE Trans. Circuits Syst. CAS-30"},{"key":"10.1016\/0012-365X(94)00389-Z_BIB3","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1002\/jgt.3190130606","article-title":"Classification of interpolation theorems for spanning trees and other families of spanning subgraphs","volume":"13","author":"Harary","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(94)00389-Z_BIB4","first-page":"215","article-title":"Interpolation theorems for invariants of spanning trees of a given graph: covering numbers","volume":"64","author":"Harary","year":"1988"},{"key":"10.1016\/0012-365X(94)00389-Z_BIB5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0167-5060(08)70462-X","article-title":"Interpolation theorems for the independence and domination numbers of spanning trees","volume":"41","author":"Harary","year":"1989","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(94)00389-Z_BIB6","first-page":"107","article-title":"Interpolation theorems for the invariants of spanning trees of a given graph: edge-covering","volume":"59","author":"Harary","year":"1987"},{"key":"10.1016\/0012-365X(94)00389-Z_BIB7","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1109\/TCS.1985.1085608","article-title":"On the diameters of spanning trees","author":"Sankaran","year":"1985","journal-title":"IEEE Trans. Circuits Syst. CAS-32"},{"key":"10.1016\/0012-365X(94)00389-Z_BIB8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/jgt.3190070209","article-title":"Interpolation theorem for the number of end-vertices of spanning trees","volume":"7","author":"Schuster","year":"1983","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(94)00389-Z_BIB9","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1109\/31.90415","article-title":"On upper bounds in tree-diameter sets of graphs","author":"Shibata","year":"1989","journal-title":"IEEE Trans. Circuits Syst. CAS-36"},{"key":"10.1016\/0012-365X(94)00389-Z_BIB10","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1109\/TCS.1985.1085785","article-title":"On the feasible tree-diameter sets of graphs","author":"Shimizu","year":"1985","journal-title":"IEEE Trans. Circuits Syst. CAS-32"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400389Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400389Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:28:24Z","timestamp":1556382504000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400389Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":10,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0012365X9400389Z"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00389-z","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}