若干联图的邻点可区别关联染色

Adjacent vertex distinguishing incidence coloring of the join of some special graphs

图G的邻点可区别关联染色是指G的任意相邻顶点具有不同色集的关联染色。研究了联图G∨Cm,G∨Sm和G∨Tm的邻点可区别关联染色,得到了相应的邻点可区别关联色数,其中G是n+1阶的星,轮或扇;Cm为m阶圈,Sm为m+1阶星,Tm为m阶树。

An adjacent vertex distinguishing incidence coloring of graph G is an incidence coloring of G such that no pair of adjacent vertices meets the same set of colors. The adjacent vertex distinguishing incidence chromatic number of G V Cm, GVSm and GVTm are obtained, where G is a star, wheel, or fan of order n ＋ 1 and Cm is a cycle of order m, and S, is a star of order m ＋ 1, Tm is a tree of order m.