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 |
| id |
id-itb.:32732 |
|---|---|
| spelling |
id-itb.:327322019-01-02T14:51:28ZON LOCATING CHROMATIC NUMBER OF MYCIELSKI Angelia Susanti, Debbie Prinsip umum matematika Indonesia Final Project color code, locating chromatic number, Mycielski graph INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/32732 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. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| topic |
Prinsip umum matematika |
| spellingShingle |
Prinsip umum matematika Angelia Susanti, Debbie ON LOCATING CHROMATIC NUMBER OF MYCIELSKI |
| description |
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. |
| format |
Final Project |
| author |
Angelia Susanti, Debbie |
| author_facet |
Angelia Susanti, Debbie |
| author_sort |
Angelia Susanti, Debbie |
| title |
ON LOCATING CHROMATIC NUMBER OF MYCIELSKI |
| title_short |
ON LOCATING CHROMATIC NUMBER OF MYCIELSKI |
| title_full |
ON LOCATING CHROMATIC NUMBER OF MYCIELSKI |
| title_fullStr |
ON LOCATING CHROMATIC NUMBER OF MYCIELSKI |
| title_full_unstemmed |
ON LOCATING CHROMATIC NUMBER OF MYCIELSKI |
| title_sort |
on locating chromatic number of mycielski |
| url |
https://digilib.itb.ac.id/gdl/view/32732 |
| _version_ |
1822923888750755840 |