Local Distance Antimagic Chromatic Number of Join Product of Graphs with Cycles or Paths
Open Access
- 15 April 2024
- journal article
- research article
- Published by Hacettepe University in Hacettepe Journal of Mathematics and Statistics
- Vol. 53 (3) , 1-15
Abstract
Let G be a graph of order p without isolated vertices. A bijection f : V → {1, 2, 3, . . . , p} is called a local distance antimagic labeling, if wf (u) ̸= wf (v) for every edge uv of G, where wf(u) =ΣxϵN(u) f(x). The local distance antimagic chromatic number χlda(G) is defined to be the minimum number of colors taken over all colorings of G induced by local distance antimagic labelings of G. In this paper, we determined the local distance antimagic chromatic number of some cycles, paths, disjoint union of 3-paths. We also determined the local distance antimagic chromatic number of join products of some graphs with cycles or paths.Keywords
This publication has 9 references indexed in Scilit:
- A Dynamic Survey of Graph LabelingThe Electronic Journal of Combinatorics, 2022
- Local distance antimagic chromatic number for the union of complete bipartite graphsTamkang Journal of Mathematics, 2022
- Local vertex antimagic chromatic number of some wheel related graphsProyecciones (Antofagasta), 2022
- ON LOCAL ANTIMAGIC CHROMATIC NUMBER OF GRAPHS2020
- Proof of a local antimagic conjectureDiscrete Mathematics & Theoretical Computer Science, 2018
- On a combination of the 1-2-3 Conjecture and the Antimagic Labelling ConjectureDiscrete Mathematics & Theoretical Computer Science, 2017
- A note on Distance Magic and Distance antimagic graphsElectronic Notes in Discrete Mathematics, 2015
- DISTANCE MAGIC GRAPHS - A SURVEYJournal of the Indonesian Mathematical Society, 2012
- Pearls in Graph Theory, a Comprehensive Introduction.The American Mathematical Monthly, 1991