On the locating-chromatic number of homogeneous lobsters
Dian Kastika Syofyan, Edy Tri Baskoro, Hilda Assiyatun · AKCE International Journal of Graphs and Combinatorics · 2020
Let G = (V, E) be a connected graph. Let Π = {C1, C2, …, Ck} be the partition of V(G) induced by a k-coloring c on V. The color code cΠ(v) of a vertex v in G is defined as (d(v, C1), d(v, C2, …, d(...