Research Article

On (k, )-locating colorings of graphs


Abstract

Let c: V(G) → {1, . . . , } = [] be a proper vertex coloring of G and C(i) = {uV(G): c(u) = i} for i ∈ []. The k-color code rk (v|c) of vertex v is the ordered -tuple (aG (v,C(1)), . . . , aG (v,C())) where

Get new issue alerts for Quaestiones Mathematicae