TY - JOUR
AU - M, Nalliah
PY - 2022/08/21
Y2 - 2024/06/14
TI - Local distance antimagic chromatic number for the union of complete bipartite graphs
JF - Tamkang Journal of Mathematics
JA - Tamkang J. Math.
VL - 54
IS - 4
SE - Papers
DO - 10.5556/j.tkjm.54.2023.4804
UR - https://journals.math.tku.edu.tw/index.php/TKJM/article/view/4804
SP - 281-291
AB - <p>Let G be a graph on p vertices and q edges with no isolated vertices. A bijection f : V → {1, 2, 3, ..., p} is called local distance antimagic labeling, if for any two adjacent vertices u and v, we have w(u) is not equal to w(v), where w(u) is the sum of all neighbour labels of u. The local distance antimagic chromatic number χlda(G) is defined to be the minimum number of colors taken overall colorings of G induced by local distance antimagic labelings of G. In this paper, we determine the graph G for the local distance antimagic chromatic number is 2.</p>
ER -