A note on the vertex-distinguishing index for some cubic graphs
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2004-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | http://www.opuscula.agh.edu.pl/vol24/2/art/opuscula_math_2420.pdf |