{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:47:53Z","timestamp":1760597273227},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2007,3,31]],"date-time":"2007-03-31T00:00:00Z","timestamp":1175299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2007,8,16]]},"DOI":"10.1007\/s10878-007-9051-y","type":"journal-article","created":{"date-parts":[[2007,3,30]],"date-time":"2007-03-30T20:59:52Z","timestamp":1175288392000},"page":"295-308","source":"Crossref","is-referenced-by-count":7,"title":["A study on cyclic bandwidth sum"],"prefix":"10.1007","volume":"14","author":[{"given":"Ying-Da","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing-Ho","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,3,31]]},"reference":[{"key":"9051_CR1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.disc.2004.10.008","volume":"290","author":"MJ Chen","year":"2005","unstructured":"Chen MJ, Kuo D, Yan JH (2005) The bandwidth sum of join and composition of graphs. Discret Math 290:145\u2013163","journal-title":"Discret Math"},{"key":"9051_CR2","first-page":"141","volume":"91","author":"PZ Chinn","year":"1992","unstructured":"Chinn PZ, Lin Y, Yuan J (1992) The bandwidth of the corona of two graph. Congr Numer 91:141\u2013152","journal-title":"Congr Numer"},{"key":"9051_CR3","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/1020084","volume":"20","author":"FRK Chung","year":"1978","unstructured":"Chung FRK (1978) A conjectured minimum valuation tree, problem and solutions. SIAM Rev 20:601\u2013604","journal-title":"SIAM Rev"},{"key":"9051_CR4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0898-1221(84)90085-3","volume":"10","author":"FRK Chung","year":"1984","unstructured":"Chung FRK (1984) On optimal linear arrangement of trees. Comput Math Appl 10:43\u201360","journal-title":"Comput Math Appl"},{"key":"9051_CR5","first-page":"151","volume-title":"Selected topics in graph theory, vol\u00a03","author":"FRK Chung","year":"1988","unstructured":"Chung FRK (1988) Labellings of graphs. In: Beineke LW, Wilson RJ (eds) Selected topics in graph theory, vol\u00a03. Academic Press, London, pp\u00a0151\u2013168"},{"key":"9051_CR6","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1137\/0134037","volume":"34","author":"MR Garey","year":"1978","unstructured":"Garey MR, Graham RL, Johnson DS, Knuth DE (1978) Complexity results for bandwidth minimization. SIAM J Appl Math 34:477\u2013495","journal-title":"SIAM J Appl Math"},{"key":"9051_CR7","first-page":"131","volume":"12","author":"LH Harper","year":"1964","unstructured":"Harper LH (1964) Optimal assignment of numbers to vertices. J\u00a0SIAM 12:131\u2013135","journal-title":"J\u00a0SIAM"},{"key":"9051_CR8","first-page":"87","volume":"47","author":"PCB Lam","year":"1997","unstructured":"Lam PCB, Shiu WC, Chan WH (1997) On bandwidth and cyclic bandwidth of graphs. Ars Comb 47:87\u201392","journal-title":"Ars Comb"},{"key":"9051_CR9","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0012-365X(00)00379-4","volume":"242","author":"PCB Lam","year":"2002","unstructured":"Lam PCB, Shiu WC, Chan WH (2002) Characterization of graphs with equal bandwidth and cyclic bandwidth. Discret Math 242:283\u2013289","journal-title":"Discret Math"},{"issue":"3","key":"9051_CR10","first-page":"282","volume":"7","author":"Y Lin","year":"1994","unstructured":"Lin Y (1994) The cyclic bandwidth problem. Syst Sci Math Sci 7(3):282\u2013288","journal-title":"Syst Sci Math Sci"},{"key":"9051_CR11","first-page":"77","volume":"90","author":"K Williams","year":"1992","unstructured":"Williams K (1992) Determining bandwidth sum for certain graph sums. Congr Numer 90:77\u201386","journal-title":"Congr Numer"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9051-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9051-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9051-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:11Z","timestamp":1559276291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9051-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,31]]},"references-count":11,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,8,16]]}},"alternative-id":["9051"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9051-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,31]]}}}