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 |