Local Distance Antimagic Vertex Coloring of Graphs

MaRDI QIDQ6369346zbMATH OpenFDO

Authors Divya T, Devi Yamini S

Publication date 3 June 2021

Abstract: A bijective function $f:Vightarrowleft1,2,3,\mathrm{...},|V|ight$ is said to be a local distance antimagic labeling of a graph $G=(V,E)$, if $w(u)eqw(v)$ for any two adjacent vertices $u,v$ where the weight $w(v)=su{m}_{zinN(v)}f(z)$. The local distance antimagic labeling of $G$ induces a proper coloring in $G$, called local distance antimagic chromatic number denoted by $ch{i}_{ld}(G)$. In this article, we introduce the parameter $ch{i}_{ld}(G)$ and compute the local distance antimagic chromatic number of graphs. Keywords: Distance antimagic labeling, Local distance antimagic labeling, Local distance antimagic chromatic number.

This page was built for publication: Local Distance Antimagic Vertex Coloring of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6369346)