The adjacent vertex distinguishing incidence coloring number of flower graphs
Xia Zhang · Journal of Natural Science of Heilongjiang University · 2010
A wheel Wr+1 (r≥3) is a graph obtained from a cycle of order rby adding a new vertex and joining the new vertex to all the vertices on the cycle.The new edges between the new vertex and the vertices on the cycle are called spoke edges,the edges on the cycle are called rim edges.A flower graph Fr,m,n (r≥3,m≥1,n≥2m+1) is a graph obtained from Wr+1 by inserting m-1 new vertices in every spoke edge and n-2m-1 new vertices in every rim edge.The adjacent vertex distinguishing incidence coloring of the flower graphs is studied.The adjacent vertex distinguishing incidence coloring numbers of some of them are determined,and an upper bound of the adjacent vertex distinguishing incidence coloring numbers of all the others are given.