Optimal Adjacent Vertex-Distinguishing Edge-Colorings of Circulant Graphs

A $k$-proper edge-coloring of a graph G is called adjacent vertex-distinguishing if any two adjacent vertices are distinguished by the set of colors appearing in the edges incident to each vertex. The smallest value $k$ for which $G$ admits such coloring is denoted by $\chi'_a(G)$. We prove that $\chi'_a(G) = 2R + 1$ for most circulant graphs $C_n([1, R])$.

[1]  Richard H. Schelp,et al.  Vertex-distinguishing proper edge-colorings , 1997, Journal of Graph Theory.

[2]  Roman Soták,et al.  Arbitrarily large difference between dd-strong chromatic index and its trivial lower bound , 2013, Discret. Math..

[3]  P. Balister,et al.  Vertex-distinguishing edge colorings of graphs , 2003 .

[4]  Olivier Togni,et al.  Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs , 2012, Ars Comb..

[5]  Wei-Fan Wang,et al.  Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree , 2010, J. Comb. Optim..

[6]  André Raspaud,et al.  Strong Chromatic Index Of Planar Graphs With Large Girth , 2013, Discuss. Math. Graph Theory.

[7]  Hamed Hatami,et al.  Delta+300 is a bound on the adjacent vertex distinguishing edge chromatic number , 2005, J. Comb. Theory, Ser. B.

[8]  Richard H. Schelp,et al.  Strong edge colorings of graphs , 1996, Discret. Math..

[9]  Tao Wang,et al.  Odd graph and its applications to the strong edge coloring , 2014, Appl. Math. Comput..

[10]  Hao Li,et al.  On the Vertex-Distinguishing Proper Edge-Colorings of Graphs , 1999, J. Comb. Theory B.

[11]  Richard H. Schelp,et al.  Adjacent Vertex Distinguishing Edge-Colorings , 2007, SIAM J. Discret. Math..

[12]  Zsolt Tuza,et al.  Irregular assignments and vertex-distinguishing edge-colorings of graphs , 1990 .

[13]  Hervé Hocquard,et al.  Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ , 2013, J. Comb. Optim..

[14]  Jianfang Wang,et al.  Adjacent strong edge coloring of graphs , 2002, Appl. Math. Lett..

[15]  Olivier Togni,et al.  Adjacent vertex distinguishing edge-colorings of meshes and hypercubes , 2006 .

[16]  Saieed Akbari,et al.  r-Strong edge colorings of graphs , 2006, Discret. Math..