A note on the vertex-distinguishing index for some cubic graphs
Karolina Taczuk, Mariusz Woźniak · DOAJ (DOAJ: Directory of Open Access Journals) · 2004
The vertex-distinguishing index of a graph \(G\) (\(\operatorname{vdi}(G)\)) is the minimum number of colours required to colour properly the edges of a graph in such a way that any two vertices are incident with different sets of colours. We consider this parameter for some families of cubic graphs.