J4 ›› 2011, Vol. 46 ›› Issue (8): 89-91.

• Articles • Previous Articles     Next Articles

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

WANG Qian, TIAN Shuang-liang   

  1. Mathematics and Computer Science College of Northwest University for Nationalities, Lanzhou 730030,  Gansu, China
  • Received:2010-05-26 Online:2011-08-20 Published:2011-09-08

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

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!