Local Distance Antimagic Vertex Coloring of Graphs

2021/06/03 by T. Divya, T, Divya, Devi Yamini S +1 · 1 citation
Computer Science · Mathematics · #Graph Labeling and Dimension Problems #Advanced Graph Theory Research #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.2106.01833

Abstract

A bijective function f:V→\1,2,3,...,|V| \ is said to be a local distance antimagic labeling of a graph G=(V,E), if w(u)≠ w(v) for any two adjacent vertices u, v where the weight w(v)=∑_{z∈ N(v)}f(z). The local distance antimagic labeling of G induces a proper coloring in G, called local distance antimagic chromatic number denoted by χ_ld(G). In this article, we introduce the parameter χ_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.

Cited by

• Local Distance Antimagic Labeling of Neighborhood Balanced Graphs

Related

• Some Results on Local Distance Antimagic Chromatic Number of Graphs
• Local Distance Antimagic Labeling of Neighborhood Balanced Graphs
• Affirmative Solutions On Local Antimagic Chromatic Number
• Local Antimagic Coloring of Some Graphs
• Local antimagic chromatic number of partite graphs