Super Total Local Antimagic Vertex Coloring of Graphs

MaRDI QIDQ6430738zbMATH OpenFDO

Authors Ravindra Pawar, Tarkeshwar Singh

Publication date 24 March 2023

Mathematics Subject Classification ID

Graph theory (05Cxx) Optics, electromagnetic theory (78-XX)

Abstract: Let $G=(V,E)$ be a finite simple undirected graph without isolated vertices. A bijective map $f:VcupEightarrow1,2,dots,|V|+|E|$ is called total local antimagic labeling if for each edge $uvinE,w(u)ew(v)$, where $w(v)$ is a weight of a vertex $v$ defined by $w(v)=su{m}_{xinNT(v)}f(x)$, where $NT(u)=N(u)cupuv:uvinE$ is the total open neighborhood of a vertex $u$. Further, $f$ is called super vertex total local antimagic labeling or super edge total local antimagic labeling if $f(V)=1,2,dots,|V|$ or $f(E)=1,2,dots,|E|$, respectively. The labeling $f$ induces a proper vertex coloring of $G$. The super vertex (edge) total local antimagic chromatic number of a graph $G$ is the minimum number of colors used overall colorings of $G$ induced by super vertex (edge) total local antimagic labeling of $G$. In this paper, we have calculated the super vertex (edge) total local antimagic chromatic number of some families of graphs.

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

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