Opuscula Mathematica

Opuscula Math.
 24
, no. 2
 (), 223-229
Opuscula Mathematica

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



Abstract. 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.
Keywords: edge colouring, vertex-distinguishing colouring, cubic graphs.
Mathematics Subject Classification: 05C15.
Cite this article as:
Karolina Taczuk, Mariusz Woźniak, A note on the vertex-distinguishing index for some cubic graphs, Opuscula Math. 24, no. 2 (2004), 223-229
 
Download this article's citation as:
a .bib file (BibTeX), a .ris file (RefMan), a .enw file (EndNote)
or export to RefWorks.

RSS Feed

horizontal rule

ISSN 1232−9274, e-ISSN 2300−6919, DOI http://dx.doi.org/10.7494/OpMath
Copyright © 2003−2017 OPUSCULA MATHEMATICA
Contact: opuscula@agh.edu.pl
Made by Tomasz Zabawa

horizontal rule

In accordance with EU legislation we advise you this website uses cookies to allow us to see how the site is used. All data is anonymized.
All recent versions of popular browsers give users a level of control over cookies. Users can set their browsers to accept or reject all, or certain, cookies.