{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:59Z","timestamp":1720640879925},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"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":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1016\/j.endm.2009.07.048","type":"journal-article","created":{"date-parts":[[2009,7,31]],"date-time":"2009-07-31T13:09:07Z","timestamp":1249045747000},"page":"295-300","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["Antibandwidth and Cyclic Antibandwidth of Hamming Graphs"],"prefix":"10.1016","volume":"34","author":[{"given":"Stefan","family":"Dobrev","sequence":"first","affiliation":[]},{"given":"Rastislav","family":"Kr\u00e1lovi\u010d","sequence":"additional","affiliation":[]},{"given":"Dana","family":"Pardubsk\u00e1","sequence":"additional","affiliation":[]},{"given":"L'ubom\u00edr","family":"T\u00f6r\u00f6k","sequence":"additional","affiliation":[]},{"given":"Imrich","family":"Vrt'o","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2009.07.048_bib001","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.endm.2006.06.028","article-title":"Antibandwidth of complete k-ary trees","volume":"24","author":"Calmoneri","year":"2006","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"10.1016\/j.endm.2009.07.048_bib002","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0012-365X(98)00346-X","article-title":"Hamiltonian powers in treshold and arborescent comparability graphs","volume":"202","author":"Donnely","year":"1999","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.endm.2009.07.048_bib003","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/568522.568523","article-title":"A survey of graph layout problems","volume":"34","author":"D\u00edaz","year":"2002","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/j.endm.2009.07.048_bib004","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","article-title":"Frequency assignment: theory and applications","volume":"60","author":"Hale","year":"1980","journal-title":"Proceedings of IEEE"},{"key":"10.1016\/j.endm.2009.07.048_bib005","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/(SICI)1097-0118(199805)28:1<31::AID-JGT3>3.0.CO;2-G","article-title":"Powers of Hamiltonian paths in interval graphs","volume":"28","author":"Isaak","year":"1998","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.endm.2009.07.048_bib006","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1137\/0213040","article-title":"On some variants of the bandwidth minimization problem","volume":"13","author":"Leung","year":"1984","journal-title":"SIAM J. Computing"},{"key":"10.1016\/j.endm.2009.07.048_bib007","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1002\/net.3230190604","article-title":"On the separation number of a graph","volume":"19","author":"Miller","year":"1989","journal-title":"NETWORKS"},{"key":"10.1016\/j.endm.2009.07.048_bib008","doi-asserted-by":"crossref","first-page":"3541","DOI":"10.1016\/j.disc.2007.12.058","article-title":"Antibandwidth and cyclic antibandwidth of meshes and hypercubes","volume":"309","author":"Raspaud","year":"2009","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.endm.2009.07.048_bib009","unstructured":"Tao Jiang, Miller, Z., Pritikin, D., Separation numbers of trees, Theoretical Computer Science, to appear"},{"key":"10.1016\/j.endm.2009.07.048_bib010","unstructured":"T\u00f6r\u00f6k, L'., Vrt'o, I., Antibandwidth of three-dimensional meshes, Discrete Mathematics, to appear"},{"key":"10.1016\/j.endm.2009.07.048_bib011","doi-asserted-by":"crossref","first-page":"1947","DOI":"10.1016\/j.dam.2008.12.004","article-title":"On explicit formulas for bandwidth and antibandwidth of hypercubes","volume":"8","author":"Wang","year":"2009","journal-title":"Discrete Applied Mathematics"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065309000900?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065309000900?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T20:58:31Z","timestamp":1545080311000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065309000900"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":11,"alternative-id":["S1571065309000900"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2009.07.048","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}