关于距离图的L(2,1)-标号着色.pdfVIP

Journal of Southeast University ( English Edition) Vol. 21, No. 2 , pp . 244 248 June 2005 ISSN 1003—7985 On ! ( 2, 1) -labellings of distance graphs 1 2 3 Tao Fangyun Gu Guohua Xu Kexiang ( 1 Department of Mathematics of College of Information Science and Technology, Nanjing Forest University, Nanjing 210037, China) ( 2 Department of Mathematics, Southeast University, Nanjing 210096, China) ( 3 College of Science, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China) Abstract:The L(2, 1) -labelling number of distance graphs G( D) , denoted by !( D) , is studied. It is shown that distance graphs satisfy !( G) ＄2 . Moreover, we prove !( {1, 2, ., k}) =2k +2 and ! ( {1, 3, ., 2k -1}) =2k +2 for any fixed positive integer k. Suppose k, a N and k, a 2. If k a, then ( {a, a +1, ., a +k -1}) = E 3 3 ! 2( a +k -1) . Otherwise, !( {a, a +1, ., a +k -1 }) ＄min {2 ( a +k -1) , 6k -2 }. When D consists of two positive integers, 6 ( D) 8. For the special distance sets D ={k, k +1}( k N) , the upper bound of ( D) ＄! ＄ V E ! is improved to 7. Key words: channel assignment problem ; L( 2 , 1) -labelling; distance graphs The channel assignment problem[ 1] is to assign a channel( nonnegative integer) to each radio transmitter so that interfering transmitters are assigned channels whose separation is not in a set of disallowed separations. Ro- berts introduced a variation