A Note on the Vertex-distinguishing Index for Some Cubic Graphs

Abstract

The vertex-distinguishing index of a graph G (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. 

Topics

3 Figures and Tables

Cite this paper

@inproceedings{Taczuk2004ANO, title={A Note on the Vertex-distinguishing Index for Some Cubic Graphs}, author={Karolina Taczuk and Mariusz Wozniak}, year={2004} }