多重联图S_m∨P_n∨P_n的邻点可区别边色数  

The chromatic number of adjacent-position distinguishable edge coloring of multi-joined graph S_m∨P_n∨P_n

作　　者：刘信生[1] 田京京[2] 

机构地区：[1]西北师范大学数学与信息科学学院,甘肃兰州730070 [2]陕西理工学院数学系,陕西汉中723000

出　　处：《兰州理工大学学报》2007年第5期136-139,共4页Journal of Lanzhou University of Technology

基　　金：甘肃省自然科学基金(3ZS051-A25-025)

摘　　要：设G(V,E)为阶数至少是3的简单连通图,若f是图G的k-正常边染色,使得对任意的uv∈E(G),C(u)≠C(v),那么称f是图G的k-邻点可区别边染色(k-ASEC),其中C(u)={f(uw)|uw∈E(G)},而aχs′(G)=min{k|存在G的一个k-ASEC},称为G的邻点可区别边色数.给出多重联图Sm∨Pn∨Pn的邻点可区别边色数.Let G=（V,E） be a simply connected graph of order≥3. A k-normal edge-coloring f for G is called a k-adjacent-position distinguishable edge-coloring （shortly, k-ASEC） for G if any two adjacent vertices are incident to different sets of colored edges. The minimum of all positive integers k such that there is a k-ASEC for G is said to be the chromatic number of adjacent-position distinguishable edge coloring of G and denoted by Xas′（G）. The chromatic number of adjacent-position distinguishable edge coloring of the multi-joined graph Sm∨Pn∨Pn was given.

关 键 词：图 联图 路 星 邻点可区别边色数 

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