Algorithm for Determining Locating-chromatic Number of Trees
The concept of the locating-chromatic number for graphs was introduced by Chartrand et al (2002). Determination of the locating-chromatic number of an arbitrary graph is an NP-complete Problem. This means that there is no efficient algorithm to determine the locating-chromatic number of any given...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/38771 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |