{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T22:27:50Z","timestamp":1672698470586},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"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":5645,"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":[[1998,2]]},"DOI":"10.1016\/s0012-365x(97)00040-x","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"255-266","source":"Crossref","is-referenced-by-count":3,"title":["Harper-type lower bounds and the bandwidths of the compositions of graphs"],"prefix":"10.1016","volume":"181","author":[{"given":"Sanming","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00040-X_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(97)00040-X_BIB2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/jgt.3190060302","article-title":"The bandwidth problem for graphs and matrices \u2014 a survey","volume":"6","author":"Chinn","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00040-X_BIB3","first-page":"167","article-title":"Bandwidth of the composition of certain graph powers","volume":"39","author":"Chinn","year":"1995","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(97)00040-X_BIB4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.21136\/CMJ.1970.100949","article-title":"A remark on a problem of Harary","volume":"20","author":"Chv\u00e1tal","year":"1970","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/S0012-365X(97)00040-X_BIB5","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(75)90039-4","article-title":"Optimal labeling of a product of two paths","volume":"11","author":"Chvatalova","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00040-X_BIB6","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1137\/0134037","article-title":"Complexity results for bandwidth minimization","volume":"34","author":"Garey","year":"1978","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0012-365X(97)00040-X_BIB7","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","article-title":"Optimal numberings and isoperimeter problems on graphs","volume":"1","author":"Harper","year":"1966","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(97)00040-X_BIB8","first-page":"251","article-title":"On the boundary inequality for bandwidth of graphs","volume":"42","author":"Li","year":"1996","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(97)00040-X_BIB9","first-page":"1","article-title":"The bandwidth of the discrete tori Cm \u00d7 Cn","volume":"11","author":"Li","year":"1981","journal-title":"J. China Univ. Sci. Tech."},{"key":"10.1016\/S0012-365X(97)00040-X_BIB10","first-page":"11","article-title":"On the Harper's method for the bandwidth problem in graph theory","volume":"2","author":"Lin","year":"1983","journal-title":"Chinese J. Oper. Res."},{"key":"10.1016\/S0012-365X(97)00040-X_BIB11","first-page":"86","article-title":"Some theorems for the bandwidth of a graph","volume":"7","author":"Mai","year":"1984","journal-title":"Acta Math. Appl. Sinica"},{"key":"10.1016\/S0012-365X(97)00040-X_BIB12","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02280884","article-title":"The NP-completeness of the bandwidth minimization problem","volume":"16","author":"Papadimitriou","year":"1976","journal-title":"Computing"},{"key":"10.1016\/S0012-365X(97)00040-X_BIB13","article-title":"On the bandwidth of graphs","author":"Yuan","year":"1989"},{"key":"10.1016\/S0012-365X(97)00040-X_BIB14","first-page":"10","article-title":"The bandwidth of the join of two graphs","volume":"8","author":"Yuan","year":"1990","journal-title":"Henan Sci."},{"key":"10.1016\/S0012-365X(97)00040-X_BIB15","first-page":"213","article-title":"Some upper bounds and lower bounds of the bandwidth of graphs","volume":"10","author":"Yuan","year":"1992","journal-title":"Henan Sci."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9700040X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9700040X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,9]],"date-time":"2021-05-09T06:35:02Z","timestamp":1620542102000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9700040X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0012365X9700040X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00040-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}