J4 ›› 2011, Vol. 46 ›› Issue (8): 89-91.
• Articles • Previous Articles Next Articles
WANG Qian, TIAN Shuang-liang
Received:
Online:
Published:
Abstract:
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∨Cm, G∨Sm and G∨Tm are obtained, where G is a star, wheel, or fan of order n+1 and Cm is a cycle of order m, Sm is a star of order m+1, Tm is a tree of order m.
Key words: join of graphs; incidence coloring; adjacent vertex distinguishing incidence coloring; adjacent vertex distinguishing incidence chromatic number
WANG Qian, TIAN Shuang-liang. Adjacent vertex distinguishing incidence coloring of the join of some special graphs[J].J4, 2011, 46(8): 89-91.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: http://lxbwk.njournal.sdu.edu.cn/EN/
http://lxbwk.njournal.sdu.edu.cn/EN/Y2011/V46/I8/89
Cited
