Optimal Adjacent Vertex-Distinguishing Edge-Colorings of Circulant Graphs

MaRDI QIDQ6339499zbMATH OpenFDO

Authors Sylvain Gravier, Souad Slimani

Publication date 27 April 2020

Abstract: 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{\text{'}}_a(G)$. We prove that $chi{\text{'}}_a(G)=2R+1$ for most circulant graphs $C_n([1,R])$.

This page was built for publication: Optimal Adjacent Vertex-Distinguishing Edge-Colorings of Circulant Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6339499)