| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 488603 | Procedia Computer Science | 2015 | 5 Pages |
Abstract
Let G = (V, E) be a connected graph. The locating-chromatic number of G, denoted by χL(G), is the cardinality of a minimum locating coloring of the vertex set V(G) such that all vertices have distinct coordinates. The results on locating-chromatic number of graphs are still limited. In particular, the locating-chromatic number of trees is not completely solved. Therefore, in this paper, we study the locating-chromatic number of any binary tree.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
