The Locating-Chromatic Number of Binary Trees

Autor:	Edy Tri Baskoro, Hilda Assiyatun, Dian Kastika Syofyan
Rok vydání:	2015
Předmět:	K-ary tree Computer science Branch-decomposition Tree-depth Random binary tree Combinatorics Cardinality Computer Science::Discrete Mathematics Graph power Binary expression tree Graph toughness Self-balancing binary search tree Connectivity Color code General Environmental Science Minimum degree spanning tree binary tree Mathematics::Combinatorics Trémaux tree Spanning tree Binary tree Degree (graph theory) Shortest-path tree Neighbourhood (graph theory) Tree (graph theory) Graph Vertex (geometry) tree graph locating-chromatic number Cycle graph General Earth and Planetary Sciences Bound graph Fractional coloring
Zdroj:	ICGTIS
ISSN:	1877-0509
DOI:	10.1016/j.procs.2015.12.079
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e52c4fb4b7a3d6175bed5e145349c6e6 https://doi.org/10.1016/j.procs.2015.12.079 Zobrazit plný text záznamu