Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4650776 | Discrete Mathematics | 2008 | 8 Pages |
Abstract
The vertex-distinguishing index χs′(G) of a graph G is the minimum number of colours required to properly colour the edges of G in such a way that any two vertices are incident with different sets of colours. We consider this parameter for some regular graphs. Moreover, we prove that for any graph, the value of this invariant is not changed if the colouring above is, in addition, required to be equitable.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Janka Rudašová, Roman Soták,