首页 | 本学科首页   官方微博 | 高级检索  
     

无爪图与分裂图的L(d,1)-T标号
引用本文:王慧娟,孙磊. 无爪图与分裂图的L(d,1)-T标号[J]. 暨南大学学报(自然科学与医学版), 2010, 31(1)
作者姓名:王慧娟  孙磊
作者单位:山东师范大学数学科学学院,济南,250014
基金项目:国家自然科学基金项目(60673047)
摘    要:给定一个简单连通图G及其一棵支撑树T,图G的1个L(d,1)-T标号即一个标号函数g满足:①G的任意2个相邻点的标号至少差1;②T上任意两个相邻点的标号至少差d;③G上任意两个距离为2的点的标号至少差1.本文研究了无爪图与分裂图的L(d,1)-T标号并给出了Tld,T(G)一个界.

关 键 词:L(d  1)-标号  1)-T标号  支撑树  无爪图  分裂图  

The L(d,1)-T labeling on craw-free Graphs and splitted Graphs
WANG Hui-juan,SUN Lei. The L(d,1)-T labeling on craw-free Graphs and splitted Graphs[J]. Journal of Jinan University(Natural Science & Medicine Edition), 2010, 31(1)
Authors:WANG Hui-juan  SUN Lei
Affiliation:Department of Mathematics Science;Shandong Normal University;Jinan 250014;China
Abstract:Given a simple connected graph G and a spanning tree T of G,a L(d,1)-T labeling for G is a function g such that ① the labels of adjacent vertices in G are different;② the labels of adjacent vertices in T are different by at least d;③ the labels of adjacent vertices with distance 2 in T are different. The L(d,1)-T labeling of the craw-free graph and splitted graph is studied and a bound of the T_(λd,T)(G) is obtained.
Keywords:L(d,1)-labeling  L(d,1)-T labeling  spanning tree  craw-free graph  splitted graph
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号