Distance three labellings for K_n×K₂

References

• Bertossi , A. , Pinotti , C. and Tan , R. 2003 . Channel assignment with separation for interference avoidance in wireless networks . IEEE Trans. Parallel and Distrib. Syst. , 14 : 222 – 235 . (doi:10.1109/TPDS.2003.1189581)
   Web of Science ®Google Scholar
• Calamoneri , T. 2006 . The L(h, k)-labeling problem: A survey and annotated bibliography . Computer J. , 49 : 585 – 608 . (doi:10.1093/comjnl/bxl018)
   Web of Science ®Google Scholar
• Calamoneri , T. 2011 . The L(h, k)-labeling problem: An updated survey and annotated bibliography . Computer J. , 54 : 1344 – 1371 . (doi:10.1093/comjnl/bxr037)
   Web of Science ®Google Scholar
• Calamoneri , T. , Fusco , E. , Tan , R. and Vocca , P. L(h1, 1)-labeling of outerplanar graphs . Proceedings of the 13th International Conference on Structural Information and Communication Complexity . pp. 268 – 279 . Berlin : Springer-Verlag .
   Google Scholar
• Chia , M. , Kuo , D. , Liao , H. , Yang , C. and Yeh , R. 2011 . L(3, 2, 1)-labeling of graphs . Taiwanese J. Math. , 15 : 2439 – 2457 .
   Web of Science ®Google Scholar
• Chartrand , G. , Erwin , D. , Zhang , P. and Harary , F. 2001 . Radio labelings of graphs . Bull. Inst. Combin. Appl. , 33 : 77 – 85 .
   Google Scholar
• Griggs , J. and Jin , X. 2007 . Recent progress in mathematics and engineering on optimal graph labelings with distance conditions . J. Comb. Optim. , 14 : 249 – 257 . (doi:10.1007/s10878-007-9055-7)
   Web of Science ®Google Scholar
• Griggs , J. and Yeh , R. 1992 . Labeling graphs with a condition at distance two . SIAM J. Discrete Math. , 5 : 586 – 595 . (doi:10.1137/0405048)
   Web of Science ®Google Scholar
• Hale , W. 1980 . Frequency assignment: Theory and application . Proc. IEEE , 68 : 1497 – 1514 . (doi:10.1109/PROC.1980.11899)
   Web of Science ®Google Scholar
• Haque , E. and Jha , P. 2008 . L(j, k)-labelings of Kronecker products of complete graphs . IEEE Trans. Circuits Syst. II , 55 : 70 – 73 . (doi:10.1109/TCSII.2007.908918)
   Google Scholar
• Jha , P. , Klavzar , S. and Vesel , A. 2005 . Optimal L(d, 1)-labelings of certain direct products of cycles and Cartesian products of cycles . Discrete Appl. Math. , 152 : 257 – 265 . (doi:10.1016/j.dam.2005.04.007)
   Web of Science ®Google Scholar
• Kim , B. , Song , B. and Hwang , W. Distance three labelings for direct products of three complete graphs . Taiwanese J. Math. , To appear.
   Web of Science ®Google Scholar
• Lam , P. , Lin , W. and Wu , J. 2007 . L(j, k)-labelings for the products of complete graphs . J. Comb. Optim. , 14 : 219 – 227 . (doi:10.1007/s10878-007-9057-5)
   Web of Science ®Google Scholar
• Liu , D. 2008 . Radio number for trees . Discrete Math. , 308 : 1153 – 1164 . (doi:10.1016/j.disc.2007.03.066)
   Web of Science ®Google Scholar
• Liu , D. and Xie , M. 2009 . Radio number for square paths . Ars. Combin. , 90 : 307 – 319 .
   Web of Science ®Google Scholar
• Liu , D. and Zhu , X. 2005 . Multilevel distance labelings for paths and cycles . SIAM J. Disc. Math. , 19 : 610 – 621 . (doi:10.1137/S0895480102417768)
   Web of Science ®Google Scholar
• Wang , H. , Xu , X. , Yang , Y. , Zhang , B. , Luo , M. and Wang , G. 2011 . Radio number of ladder graphs . Int. J. Comput. Math. , 88 : 2026 – 2034 . (doi:10.1080/00207160.2010.539211)
   Web of Science ®Google Scholar
• Yeh , R. 2006 . A survey on labeling graphs with a condition at distance two . Discrete Math. , 306 : 1217 – 1231 . (doi:10.1016/j.disc.2005.11.029)
   Web of Science ®Google Scholar
• Zhou , S. 2007 . Distance labeling problems for hypercubes and hamming graphs – A survey . Electron. Notes Discrete Math. , 28 : 527 – 534 . (doi:10.1016/j.endm.2007.01.073)
   Google Scholar