THE LOCATING CHROMATIC NUMBER FOR CORONA GRAPH AND SUBDIVISION OF WHEEL
The concept of graph locating chromatic number was introduced by Chartrand et al.(11) in 2002, as a marriage of two concepts in graph theory, namely the old concept of graph coloring and the new concept of graph partition dimension (90. The locating chromatic number of a graph G can be defined as th...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/16088 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | The concept of graph locating chromatic number was introduced by Chartrand et al.(11) in 2002, as a marriage of two concepts in graph theory, namely the old concept of graph coloring and the new concept of graph partition dimension (90. The locating chromatic number of a graph G can be defined as the cardinality of a minimum resolving partition of the vertex set V (G) such that all vertices have different coordinates, and every two neighboring vertices in G are not contained in the same partition class. In this case, the coordinate of a vertex in G is expressed in terms of the distances of this vertex to all partition classes. Determination of the locating chromatic number of an arbitrary graph is an NP-hard problem. Therefore, some heuristics approachs have been developed to determine the number. In addition, many studies in determining the locating chromatic number of a graph have been done by considering to some graph classes, such as paths, cycles, trees and so forth. |
|---|