Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
On Rainbow Antimagic Coloring of Joint Product of Graphs
View through CrossRef
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 any two edge and in path , where and . Rainbow antimagic coloring is a graph which has a rainbow antimagic labeling. Thus, every rainbow antimagic labeling induces a rainbow coloring G where the edge weight is the color of the edge . The rainbow antimagic connection number of graph is the smallest number of colors of all rainbow antimagic colorings of graph , denoted by . In this study, we studied rainbow antimagic coloring and have an exact value of rainbow antimagic connection number of joint product of graph where is graph , graph , graph , graph and graph .
Maulana Malik Ibrahim State Islamic University
Title: On Rainbow Antimagic Coloring of Joint Product of Graphs
Description:
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 any two edge and in path , where and .
Rainbow antimagic coloring is a graph which has a rainbow antimagic labeling.
Thus, every rainbow antimagic labeling induces a rainbow coloring G where the edge weight is the color of the edge .
The rainbow antimagic connection number of graph is the smallest number of colors of all rainbow antimagic colorings of graph , denoted by .
In this study, we studied rainbow antimagic coloring and have an exact value of rainbow antimagic connection number of joint product of graph where is graph , graph , graph , graph and graph .
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 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...
Rainbow Connection Numbers of WK-Recursive Networks and WK-Recursive Pyramids
Rainbow Connection Numbers of WK-Recursive Networks and WK-Recursive Pyramids
An edge coloring of a graph G results in G being rainbow connected when every pair of vertices is linked by a rainbow path. Such a path is defined as one where each edge possesses ...
BILANGAN STRONG RAINBOW CONNECTION UNTUK GRAF GARIS, GRAF MIDDLE DAN GRAF TOTAL
BILANGAN STRONG RAINBOW CONNECTION UNTUK GRAF GARIS, GRAF MIDDLE DAN GRAF TOTAL
Abstrak. Misalkan G = (V (G); E(G)) adalah suatu graf terhubung tak trivial. Denisipewarnaan c : E(G) ! f1; 2; ; kg; k 2 N, dimana dua sisi yang bertetanggaboleh berwarna sama. ...
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...
Navigating Rainbow Parenthood At Work: An Exploration Of The Work Experiences And Changing Identities Of Rainbow Parents – A Qualitative Study
Navigating Rainbow Parenthood At Work: An Exploration Of The Work Experiences And Changing Identities Of Rainbow Parents – A Qualitative Study
<p dir="ltr"><b>Abstract New Zealand’s society has and continues to evolve, leading to more inclusive definitions of the concept of family. Over the past two decades, i...