Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Local vertex antimagic chromatic number of some wheel related graphs
View through CrossRef
Let G = (V,E) be a graph of order p and size q having no isolated vertices. A bijection ƒ : E → {1, 2, 3, ..., q} is called a local antimagic labeling if for all uv ∈ E we have w(u) ≠ w(v), the weight w(u) = ∑e∈E(u) f(e) where E(u) is the set of edges incident to u. A graph G is local antimagic if G has a local antimagic labeling. The local antimagic chromatic number χla(G) is defined to be the minimum number of colors taken over all colorings of G induced by local antimagic labelings of G. In this paper, we determine the local antimagic chromatic number for some wheel related graphs.
Title: Local vertex antimagic chromatic number of some wheel related graphs
Description:
Let G = (V,E) be a graph of order p and size q having no isolated vertices.
A bijection ƒ : E → {1, 2, 3, .
, q} is called a local antimagic labeling if for all uv ∈ E we have w(u) ≠ w(v), the weight w(u) = ∑e∈E(u) f(e) where E(u) is the set of edges incident to u.
A graph G is local antimagic if G has a local antimagic labeling.
The local antimagic chromatic number χla(G) is defined to be the minimum number of colors taken over all colorings of G induced by local antimagic labelings of G.
In this paper, we determine the local antimagic chromatic number for some wheel related graphs.
Related Results
Local Antimagic Edge Coloring Of Gear Graphs And Semi Parachute Graphs
Local Antimagic Edge Coloring Of Gear Graphs And Semi Parachute Graphs
The graph G is a pair of sets consisting of a vertex set V(G) and an edge set E(G), denoted by G = (V (G),E(G)). Coloring a graph involves assigning colors to each vertex, edge, or...
On the Study of Rainbow Antimagic Connection Number of Comb Product of Friendship Graph and Tree
On the Study of Rainbow Antimagic Connection Number of Comb Product of Friendship Graph and Tree
Given a graph G with vertex set V(G) and edge set E(G), for the bijective function f(V(G))→{1,2,⋯,|V(G)|}, the associated weight of an edge xy∈E(G) under f is w(xy)=f(x)+f(y). If a...
On Rainbow Antimagic Coloring of Joint Product of Graphs
On Rainbow Antimagic Coloring of Joint Product of Graphs
Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for ...
On local edge antimagic chromatic number of graphs
On local edge antimagic chromatic number of graphs
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 ...
Local antimagic vertex coloring of unicyclic graphs
Local antimagic vertex coloring of unicyclic graphs
The local antimagic labeling on a graph G with |V| vertices and |E| edges is defined to be an assignment f : E --> {1, 2,..., |E|} so that the weights of any two adjacent ve...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
On The Local Edge Antimagic Coloring of Corona Product of Path and Cycle
On The Local Edge Antimagic Coloring of Corona Product of Path and Cycle
Let be a nontrivial and connected graph of vertex set and edge set . A bijection is called a local edge antimagic labeling if for any two adjacent edges and , where for . Thus...