ON LOCATING CHROMATIC NUMBER OF MYCIELSKI
Let G be a finite, simple and connected graph. Let c a proper coloring of G. For i = 1; 2; :::; k define the color class Ci as the set of vertices receiving color i. The color code of a vertex v in G is the ordered k-tuple c(v) = (d(v;C1); d(v;C2); :::; d(v;Ck)) where d(v;Ci) is the distance of v...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Subjects: | |
| Online Access: | https://digilib.itb.ac.id/gdl/view/32732 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | Let G be a finite, simple and connected graph. Let c a proper coloring
of G. For i = 1; 2; :::; k define the color class Ci as the set of vertices
receiving color i. The color code of a vertex v in G is the ordered k-tuple
c(v) = (d(v;C1); d(v;C2); :::; d(v;Ck)) where d(v;Ci) is the distance of v
to Ci. If all distinct vertices of G have distinct color codes, then c is called a
locating coloring of G. The locating chromatic number of graph G, denoted by
L(G) is the smallest k such that G has a locating coloring with k colors. In this
book, the writer investigate the locating chromatic number of Mycielski graph of G. |
|---|