Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
On The Local Edge Antimagic Coloring of Corona Product of Path and Cycle
View through CrossRef
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, the local edge antimagic labeling induces a proper edge coloring of G if each edge e assigned the color . The color of each an edge e = uv is assigned bywhich is defined by the sum of label both and vertices and . The local edge antimagic chromatic number, denoted by is the minimum number of colors taken over all colorings induced by local edge antimagic labeling of . In our paper, we present the local edge antimagic coloring of corona product of path and cycle, namely path corona cycle, cycle corona path, path corona path, cycle corona cycle.Keywords: Local antimagic; edge coloring; corona product; path; cycle.
Maulana Malik Ibrahim State Islamic University
Title: On The Local Edge Antimagic Coloring of Corona Product of Path and Cycle
Description:
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, the local edge antimagic labeling induces a proper edge coloring of G if each edge e assigned the color .
The color of each an edge e = uv is assigned bywhich is defined by the sum of label both and vertices and .
The local edge antimagic chromatic number, denoted by is the minimum number of colors taken over all colorings induced by local edge antimagic labeling of .
In our paper, we present the local edge antimagic coloring of corona product of path and cycle, namely path corona cycle, cycle corona path, path corona path, cycle corona cycle.
Keywords: Local antimagic; edge coloring; corona product; path; cycle.
Related Results
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...
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 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...
Local vertex antimagic chromatic number of some wheel related graphs
Local vertex antimagic chromatic number of some wheel related graphs
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...
Peningkatan Prestasi Belajar Materi Bilangan Berpangkat Melalui Model Discovery Learning
Peningkatan Prestasi Belajar Materi Bilangan Berpangkat Melalui Model Discovery Learning
This research is motivated by the unoptimally the mastery of the material is still not optimal exponential number among learners and implementation Discovery learning in mathematic...