Δ(G)=2的图的孪生强边染色  

On Twin Strong Edge Coloring of Graph with Δ(G)=2

作　　者：杨环 田双亮[1] YANG Huan;TIAN Shuang-liang(Mathematics and Computer Science College,Northwest Minzu Unversity,Lanzhou,730030,China)

机构地区：[1]西北民族大学数学与计算机科学学院,甘肃兰州730030

出　　处：《西北民族大学学报（自然科学版）》2018年第4期1-4,共4页Journal of Northwest Minzu University(Natural Science)

基　　金：国家民委科研资助项目(14XBZ018);西北民族大学研究生科研创新项目(Yxm2018116)

摘　　要：设σ是一个阶至少为3的简单连通图G的k-正常边染色,其中颜色集合为{0,1,2,…,k-1}.若对任意距离不超过2的两条边e,,存在σ(e)≠σ(),则称σ为G的强边染色.若图G的强边染色σ能够诱导一个G的2-距离点染色,则称σ是G的孪生强边染色.最少的颜色数为G的孪生强边色数,记为■_(s,t)(G).通过研究简单连通图的孪生强边染色,得到了相应的染色数.Letσbe a proper k-edge coloring of a simple connected graph G of order at least 3,where the color set is{0,1,2…,k-1}.A proper edge coloring of a graph G is called a strong edge coloring if for any two distinct edges e,e',withd(e,e')≤2,such thatσ(e)≠σ(e').Ifσcan induce a 2-distance vertex coloring of G,thenσis called a twin strong edge coloring of G.The minimum number of colors for which G has a twin strong edge coloring is called the twin strong chromatic index of G,denote byχ's,t(G).In this paper,twin strong edge colorings of simple connected graphs G are studied,and it's twin chromatic number is obtained.

关 键 词：路 圈 孪生强边染色 孪生强边色数 

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