The Locating-Chromatic Number of Binary Trees

详细信息    查看全文

• 作者：Dian Kastika Syofyan ; ^{diankastika@students.itb.ac.id" class="auth_mail" title="E-mail the corresponding author} ; Edy Tri Baskoro ; Hilda Assiyatun
• 关键词：Color code ; locating-chromatic number ; tree graph ; binary tree
• 刊名：Procedia Computer Science
• 出版年：2015
• 出版时间：2015
• 年：2015
• 卷：74
• 期：Complete
• 页码：79-83
• 全文大小：222 K

文摘

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.