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.
Let G=(V,E) be a graph of order p and size q having no isolated vertices. A bijection f from V to {1,2,3,...,p} is called a local edge antimagic labeling if for any two adjacent edges e=uv and e'=vw of G, we have w(e) is not equal to w (e'), where the edge weight w(e=uv)=f(u)+f(v) and w(e')=f(v)+f(w). A graph G is local edge antimagic if G has a local edge antimagic labeling. The local edge antimagic chromatic number is defined to be the minimum number of colors taken over all colorings of G induced by local edge antimagic labelings of G. In this paper, we determine the local edge antimagic chromatic number for a friendship graph, wheel graph, fan graph, helm graph, flower graph, and closed helm.
15 April 2024 in Hacettepe Journal of Mathematics and Statistics
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.
Let G = (V, E) be a graph of order p and size q without isolated vertices. A bijection f: E → {1, 2, … , q} is called a local antimagic labeling if w(u) ≠ w(v) for all uv ∈ E, where the vertex weight w(u) = Ʃe∈E(u)f(e) and E(u) is the set of edges incident to the vertex u ∈ V. The local antimagic chromatic number χla(G) is defined to be the minimum number of colors(vertex weights) taken over all colorings of G induced by local antimagic labelings of G. In this paper, we study the local chromatic number for generalized friendship graph of complete graphs and cycles.
1 July 2015 in Electronic Notes in Discrete Mathematics