On (<em>k</em>, <em>ℓ</em>)-locating colorings of graphs

Research Article

On (k, )-locating colorings of graphs

Published in: Quaestiones Mathematicae
Volume 47 , issue 11 , 2024 , pages: 2163–2175
DOI: 10.2989/16073606.2024.2364301
Author(s): Michael A. Henning University of Johannesburg, South Africa , Mostafa Tavakoli Ferdowsi University of Mashhad, Iran

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