A study of 3-arc graphs

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v,u,x,y)(v,u,x,y) of vertices such that both (v,u,x)(v,u,x) and (u,x,y)(u,x,y) are paths of length two. The 3-arc graph of a graph GG is defined to have the arcs of GG as vertices such that two arcs uv,xyuv,xy are adjacent if and only if (v,u,x,y)(v,u,x,y) is a 3-arc of GG. In this paper, we study the independence, domination and chromatic numbers of 3-arc graphs and obtain sharp lower and upper bounds for them. We introduce a new notion of arc-coloring of a graph in studying vertex-colorings of 3-arc graphs.