{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T17:40:13Z","timestamp":1773078013662,"version":"3.50.1"},"reference-count":31,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"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":3638,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0166-218x(02)00597-8","type":"journal-article","created":{"date-parts":[[2003,7,16]],"date-time":"2003-07-16T14:54:32Z","timestamp":1058367272000},"page":"449-460","source":"Crossref","is-referenced-by-count":32,"title":["Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers"],"prefix":"10.1016","volume":"129","author":[{"given":"Sandi","family":"Klav\u017ear","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksander","family":"Vesel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00597-8_BIB1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(86)90014-4","article-title":"The matching polynomial of a polygraph","volume":"15","author":"Babi\u0107","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB2","unstructured":"L.D. Baumert, R.J. McEliece, E. Rodemich, H.C. Rumsey, R. Stanley, H. Taylor, A combinatorial packing problem, in: Computers in Algebra and Number Theory, Proceedings of the SIAM-AMS Symposium on Applied Mathematics, American Mathematical Society, Providence, RI, 1971, pp. 97\u2013108."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB3","doi-asserted-by":"crossref","unstructured":"A.A. Bertossi, M.C. Pinotti, R.B. Tan, Channel assignment with separation for interference avoidance in wireless networks, IEEE Trans. Parallel Distrib. Systems, to appear.","DOI":"10.1109\/TPDS.2003.1189581"},{"key":"10.1016\/S0166-218X(02)00597-8_BIB4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/S0895480193245339","article-title":"The (2,1)-labeling problem on graphs","volume":"9","author":"Chang","year":"1996","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB5","doi-asserted-by":"crossref","unstructured":"J. Fiala, T. Kloks, J. Kratochv\u0131\u0301l, Fixed-parameter complexity of \u03bb-labelings, in: Graph-Theoretic Concepts in Computer Science, Springer, Berlin, 1999, Lecture Notes in Computer Science, Vol. 1665, pp. 350\u2013363.","DOI":"10.1007\/3-540-46784-X_33"},{"key":"10.1016\/S0166-218X(02)00597-8_BIB6","first-page":"141","article-title":"Generalized vertex labelings with a condition at distance two","volume":"109","author":"Georges","year":"1995","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/(SICI)1097-0118(199605)22:1<47::AID-JGT7>3.0.CO;2-L","article-title":"On the size of graphs labeled with a condition at distance two","volume":"22","author":"Georges","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(02)00597-8_BIB8","first-page":"141","article-title":"Some results of \u03bbkj-numbers of the products of complete graphs","volume":"140","author":"Georges","year":"1999","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB9","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/S0895480199351859","article-title":"Labeling products of complete graphs with a condition at distance two","volume":"14","author":"Georges","year":"2001","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0012-365X(93)E0098-O","article-title":"Relating path covering to vertex labelings with a condition at distance two","volume":"135","author":"Georges","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB11","doi-asserted-by":"crossref","unstructured":"C.D. Godsil, Problems in algebraic combinatorics, Electron. J. Combin. 2 (1995) 20pp.","DOI":"10.37236\/1214"},{"key":"10.1016\/S0166-218X(02)00597-8_BIB12","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","article-title":"Labelling graphs with a condition at distance two","volume":"5","author":"Griggs","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB13","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1988"},{"key":"10.1016\/S0166-218X(02)00597-8_BIB14","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0095-8956(73)90014-2","article-title":"Numerical invariants and the strong product of graphs","volume":"15","author":"Hales","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(02)00597-8_BIB15","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/(SICI)1097-0118(199812)29:4<263::AID-JGT5>3.0.CO;2-V","article-title":"Graph labeling and radio channel assignment","volume":"29","author":"Van den Heuvel","year":"1998","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(02)00597-8_BIB16","series-title":"Product Graphs: Structure and Recognition","author":"Imrich","year":"2000"},{"key":"10.1016\/S0166-218X(02)00597-8_BIB17","doi-asserted-by":"crossref","first-page":"1531","DOI":"10.1109\/81.886984","article-title":"Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination","volume":"47","author":"Jha","year":"2000","journal-title":"IEEE Trans. Circuits Systems-I: Fundam. Theory Appl."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB18","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1109\/81.917988","article-title":"Optimal L(2,1)-labeling of strong products of cycles","volume":"48","author":"Jha","year":"2001","journal-title":"IEEE Trans. Circuits Systems-I: Fundam. Theory Appl."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB19","first-page":"81","article-title":"On L(2,1)-labeling of the Cartesian product of a cycle and a path","volume":"55","author":"Jha","year":"2000","journal-title":"Ars Combin."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB20","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0166-218X(97)00069-3","article-title":"Distance-related invariants on polygraphs","volume":"80","author":"Juvan","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB21","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0166-218X(95)00058-Y","article-title":"Algebraic approach to fasciagraphs and rotagraphs","volume":"68","author":"Klav\u017ear","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB22","first-page":"13","article-title":"On distance two labelings of graphs","volume":"47","author":"Liu","year":"1997","journal-title":"Ars Combin."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB23","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1137\/S0895480191223178","article-title":"Labeling chordal graphs","volume":"7","author":"Sakai","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB24","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","article-title":"The zero-error capacity of a noisy channel","volume":"2","author":"Shannon","year":"1956","journal-title":"IRE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00597-8_BIB25","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0095-8956(74)90081-1","article-title":"Independence numbers of product graphs","volume":"17","author":"Sonnemann","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(02)00597-8_BIB26","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0898-1221(98)00169-2","article-title":"The independence number of the strong product of cycles","volume":"36","author":"Vesel","year":"1998","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB27","unstructured":"A. Vesel, On the domination number of the Cartesian product of two cycles, in preparation."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB28","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0020-0190(01)00229-0","article-title":"Improved lower bound on the Shannon capacity of C7","volume":"81","author":"Vesel","year":"2002","journal-title":"Inform. Proc. Lett."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB29","series-title":"Data Structures and Algorithm Analysis","author":"Weiss","year":"1995"},{"key":"10.1016\/S0166-218X(02)00597-8_BIB30","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/S0895480192242821","article-title":"On the \u03bb-number of Qn and related graphs","volume":"8","author":"Whittlesey","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00597-8_BIB31","doi-asserted-by":"crossref","unstructured":"J. \u017derovnik, Deriving formulas for domination numbers of fasciagraphs and rotagraphs, in: Fundamentals of Computation Theory, Springer, Berlin, 1999, Lecture Notes in Computer Science, Vol. 1684, pp. 559\u2013568.","DOI":"10.1007\/3-540-48321-7_47"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005978?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005978?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T18:10:58Z","timestamp":1585073458000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02005978"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":31,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0166218X02005978"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00597-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}