Research Article

On (k, ℓ)-locating colorings of graphs

Published in: Quaestiones Mathematicae
Volume 47 , issue 11, pages: 2163–2175

DOI: 10.2989/16073606.2024.2364301

Author(s): Michael A. HenningUniversity of Johannesburg, South Africa, Mostafa TavakoliFerdowsi University of Mashhad, Iran,

Keywords: Primary: 05C15, Secondary: 05C69, (k, ℓ)-locating coloring, locating coloring, neighbor-locating coloring, corona product, edge corona product, ILP model,

Download full text Get new issue alerts

Abstract

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

« Asymptotical convergence of solutions of boundary value problems for singularly perturbed higher-order integro-differential equations

On positive solutions of the Cauchy problem for doubly nonlocal equations »

Research Article

On (k, ℓ)-locating colorings of graphs

Abstract

Get new issue alerts for Quaestiones Mathematicae

Latest news

Latest articles