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: | Karolina Taczuk, Mariusz Woźniak |
---|---|
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 |
Similar Items
Similar Items
-
Algebraic Analysis of Vertex-Distinguishing Edge-Colorings
by: Clark, David
Published: (2006) -
Algebraic Analysis of Vertex-Distinguishing Edge-Colorings
by: Clark, David
Published: (2006) -
Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs
by: Fatemeh Sadat Mousavi, et al.
Published: (2017-06-01) -
Graph Distinguishability and the Generation of Non-Isomorphic Labellings
by: Bird, William Herbert
Published: (2013) -
Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m < n)
by: Chen Xiang’en, et al.
Published: (2013-05-01)