THE LOCATING-CHROMATIC NUMBER OF D(r;k) TREE
Let G be a simple connected graph and c a proper coloring of G. A color code of a vertex v is an ordered k-tuple cP(v) = (d(v;C1);d(v;C2);d(v;C3); .....d(v;Ci)) where P is a partition of vertex set in G constructed by a proper coloring c, and d(v;Ci) is the distance of v to Ci. A locating colorin...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Subjects: | |
| Online Access: | https://digilib.itb.ac.id/gdl/view/34134 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:34134 |
|---|---|
| spelling |
id-itb.:341342019-02-04T14:24:37ZTHE LOCATING-CHROMATIC NUMBER OF D(r;k) TREE Fathoni, Rois Matematika Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/34134 Let G be a simple connected graph and c a proper coloring of G. A color code of a vertex v is an ordered k-tuple cP(v) = (d(v;C1);d(v;C2);d(v;C3); .....d(v;Ci)) where P is a partition of vertex set in G constructed by a proper coloring c, and d(v;Ci) is the distance of v to Ci. A locating coloring of is a proper coloring where all vertices have distinct color codes. The minimum number of colors such that G has a locating coloring is called the locating-chromatic number, denoted by cL(G). The locating-chromatic number was first studied by Chatrand et al. in 2002. In this final project we determine the locating-chromatic number of D(r;k) for some r. D(r;k) is a tree which has diameter r and all vertices except leaves have degree k. ...... 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 |
Matematika |
| spellingShingle |
Matematika Fathoni, Rois THE LOCATING-CHROMATIC NUMBER OF D(r;k) TREE |
| description |
Let G be a simple connected graph and c a proper coloring of G. A color code
of a vertex v is an ordered k-tuple cP(v) = (d(v;C1);d(v;C2);d(v;C3); .....d(v;Ci))
where P is a partition of vertex set in G constructed by a proper coloring c, and
d(v;Ci) is the distance of v to Ci. A locating coloring of is a proper coloring where
all vertices have distinct color codes. The minimum number of colors such that G
has a locating coloring is called the locating-chromatic number, denoted by cL(G).
The locating-chromatic number was first studied by Chatrand et al. in 2002. In
this final project we determine the locating-chromatic number of D(r;k) for some
r. D(r;k) is a tree which has diameter r and all vertices except leaves have degree
k.
...... |
| format |
Final Project |
| author |
Fathoni, Rois |
| author_facet |
Fathoni, Rois |
| author_sort |
Fathoni, Rois |
| title |
THE LOCATING-CHROMATIC NUMBER OF D(r;k) TREE |
| title_short |
THE LOCATING-CHROMATIC NUMBER OF D(r;k) TREE |
| title_full |
THE LOCATING-CHROMATIC NUMBER OF D(r;k) TREE |
| title_fullStr |
THE LOCATING-CHROMATIC NUMBER OF D(r;k) TREE |
| title_full_unstemmed |
THE LOCATING-CHROMATIC NUMBER OF D(r;k) TREE |
| title_sort |
locating-chromatic number of d(r;k) tree |
| url |
https://digilib.itb.ac.id/gdl/view/34134 |
| _version_ |
1822924182938189824 |