摘要
距离2标号问题即L(2,1)-标号源于无线电的频率分配问题。关于L(2,1)-标号数λ(G),Griggs和Yeh给出猜想:对最大度为Δ的一般图G,有λ(G)≤Δ2。用穷标法证明了路与扇图的联图、星与星的联图的L(2,1)-标号数λ(G)的最小上界分别为Δ+2,Δ+3。结论满足Griggs和Yeh猜想,是个很好的结果。
The（2,1）-total labeling of a graph G originated from the radio frequency assignment problem,related to L（2,1）-labeling number,Griggs and Yeh gave out a conjecture：there always had λ（G）≤Δ2 in general graph G while maximum degree is Δ.Using exhaust marking method to the L（2,1）-labeling number λ（G）,the minimum upper bounds is Δ＋2 for the unite of path and fan graphs and Δ＋3 for the unite of star and star graphs respectively in this text.is proved The conclusion satisfies Griggs and Yeh＇s conjecture.
出处
《科学技术与工程》
2010年第29期7226-7228,共3页
Science Technology and Engineering
基金
山东省教育厅科技基金项目(TJY0706)
山东省自然科学基金项目(Y2008A20)资助
