Vertex-distinguishing proper edge colourings of some regular graphs

Abstract: The vertex-distinguishing index of a graph G is the minimum number of colours required to properly colour the edges of G in such a way that any two vertices are incident with different sets of colours. We consider this parameter for some regular graphs. Moreover, we prove that for any graph, the value of this invariant is not changed if the colouring above is, in addition, required to be equitable. [Copyright &y& Elsevier]