DOI: 10.7494/opmath.2004.24.2.223 ISSN: 1232-9274

A note on the vertex-distinguishing index for some cubic graphs

Karolina Taczuk, Mariusz Woźniak

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.

More from our Archive