The Adjacent Vertex Distinguishing Incidence Coloring Numbers of a Class of 4-Regular Planar Graphs

Zhang Li · Shuxue de shijian yu renshi · 2012

The graph R_n is defined by R_n =(V,E),V = {u_1,u_2,…u_n}∪{v_1,v_2,…,v_n} and E = {u_iu_i+1,v_iv_(i+1),u_iv_i,u_iv_(i+1)|i=1,2,…,n},where u_(n+1)=u_1,v_(n+1)= v_1.By studying the adjacent vertex distinguishing incidence coloring of R_n,we determine the adjacent vertex distinguishing incidence coloring numbers of them,when n = 4,n = 3k or n = 5k(k is a positive integer).

Read the paper · More papers on PaperTik