L(2,1)-labelings on the modular product of two graphs

Theoretical Computer Science - Tập 487 - Trang 74-81 - 2013
Zhendong Shao1,2, Roberto Solis-Oba3
1College of Mathematics, Southwest Jiaotong University, Chengdu, Sichuan, PR China
2Department of Computing Science, University of Alberta, Edmonton, AB, Canada
3Department of Computer Science, University of Western Ontario, London, ON, Canada

Tài liệu tham khảo

Chang, 1996, The L(2,1)-labeling on graphs, SIAM J. Discrete Math., 9, 309, 10.1137/S0895480193245339 Georges, 1994, On the criticality of graphs labelled with a condition at distance two, Congr. Numer., 101, 33 Georges, 1995, Generalized vertex labelings with a condition at distance two, Congr. Numer., 109, 141 Goncalves, 2008, On the L(p,1)-labeling of graphs, Discrete Math., 308, 1405, 10.1016/j.disc.2007.07.075 Griggs, 1992, Labeling graphs with a condition at distance two, SIAM J. Discrete Math., 5, 586, 10.1137/0405048 Hale, 1980, Frequency assignment: Theory and application, Proc. IEEE, 68, 1497, 10.1109/PROC.1980.11899 Imrich, 2000 F. Havet, B. Reed, J.-S. Sereni, L(2,1)-Labeling of graphs, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithm, SODA 08, San Francisco, California, 20–22 January, 2008, pp. 621–630. Jensen, 1995 Roberts, 1991, T-colorings of graphs: Recent results and open problems, Discrete Math., 93, 229, 10.1016/0012-365X(91)90258-4 Shao, 2010, L(2,1)-Labelings on the composition of n graphs, Theoret. Comput. Sci., 411, 3287, 10.1016/j.tcs.2010.03.013 Shao, 2005, The L(2,1)-labeling and operations of graphs, IEEE Trans. Circuits & Systems I: Regular Papers, 52, 668, 10.1109/TCSI.2004.840484 Shao, 2007, The L(2,1)-labeling on planar graphs, Appl. Math. Lett., 20, 222, 10.1016/j.aml.2006.02.033 Shao, 2008, The L(2,1)-Labeling of K1,n-free graphs and its applications, Appl. Math. Lett., 21, 1188, 10.1016/j.aml.2007.12.020 Shao, 2008, The L(2,1)-labeling on graphs and the frequency assignment problem, Appl. Math. Lett., 21, 37, 10.1016/j.aml.2006.08.029 Shao, 2008, Improved Bounds on the L(2,1)-labeling of the Skew and Converse Skew Products of Graphs, Theoret. Comput. Sci., 400, 230, 10.1016/j.tcs.2008.02.048 Shiu, 2008, A new approach to the L(2,1)-labeling of some products of graphs, IEEE Trans. Circuits & Systems II, 55, 802, 10.1109/TCSII.2008.922450 Yeh, 2006, A survey on labeling graphs with a condition at distance two, Discrete Math., 306, 1217, 10.1016/j.disc.2005.11.029