自补图的L(2,1)-标号  

The L(2,1)-labeling Problem on Self-complementary Graphs

作　　者：马巧灵[1] 张苏梅[1] 刘成立[1] 

机构地区：[1]济南大学理学院,山东济南250022

出　　处：《济南大学学报（自然科学版）》2006年第2期182-183,共2页Journal of University of Jinan(Science and Technology)

基　　金：山东省自然科学基金(Y2003A01)

摘　　要：研究自补图G的L(2,1)-标号问题,证明了自补图的L(2,1)-标号数满足λ(G)≤2Δ。验证了关于一般图的L(2,1)-标号数的猜想λ(G)≤Δ2对于自补图的正确性。A graph G is said to be self- complementary if it is isomorphic with its complement. In this paper, we studied the problem of L （2, 1 ） - labeling on self - complementary graphs and proved that λ （G） ≤ 2△ for self- complementary graphs. The well - known conjecture that λ （ G ） ≤ △^2 for self - complementary graphs has been verified.

关 键 词：运筹学 自补图 L(2 1)-标号 

分 类 号：O157.5[理学—数学]