Trees with Certain Locating-chromatic Number
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 distinct coordinates with respect to this partition and every two adjacent vertices in G are not contained in the same partition class. In...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
ITB Journal Publisher
2016-03-01
|
| Series: | Journal of Mathematical and Fundamental Sciences |
| Subjects: | |
| Online Access: | http://journals.itb.ac.id/index.php/jmfs/article/view/1470 |