Results 1 to 9 of about 9 (9)

On Rainbow Antimagic Coloring of Joint Product of Graphs

open access: yesCauchy: Jurnal Matematika Murni dan Aplikasi, 2023
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 .
Brian Juned Septory   +3 more
doaj   +1 more source

On the Study of Rainbow Antimagic Connection Number of Comb Product of Friendship Graph and Tree

open access: yesSymmetry, 2022
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 all edges have pairwise distinct weights, the function f is called an edge-antimagic vertex labeling.
Brian Juned Septory   +3 more
openaire   +1 more source

On Rainbow Vertex Antimagic Coloring of Graphs: A New Notion

open access: yesCauchy: Jurnal Matematika Murni dan Aplikasi, 2021
All graph in this paper are simple, finite, and connected. Let  be a labeling of a graph . The function  is called antimagic rainbow edge labeling if for any two vertices  and , all internal vertices in path  have different weight, where the weight of ...
Marsidi Marsidi   +3 more
doaj   +1 more source

ON RAINBOW ANTIMAGIC COLORING OF SNAIL GRAPH(S_n ), COCONUT ROOT GRAPH (Cr_(n,m) ), FAN STALK GRAPH (Kt_n ) AND THE LOTUS GRAPH(Lo_n )

open access: yesBarekeng, 2023
Rainbow antimagic coloring is a combination of antimagic labeling and rainbow coloring. Antimagic labeling is labeling of each vertex of the graph  with a different label, so that each the sum of the vertices in the graph has a different weight. Rainbow
R Adawiyah   +4 more
doaj   +1 more source

On the study of Rainbow Antimagic Coloring of Special Graphs

open access: yesCauchy: Jurnal Matematika Murni dan Aplikasi, 2023
Let  be a connected graph with vertex set  and edge set . The bijective function  is said to be a labeling of graph where  is the associated weight for edge .
Dafik Dafik   +3 more
doaj   +1 more source

On the study of Rainbow Antimagic Connection Number of Corona Product of Graphs

open access: yesEuropean Journal of Pure and Applied Mathematics, 2023
Given that a graph G = (V, E). By an edge-antimagic vertex labeling of graph, we mean assigning labels on each vertex under the label function f : V → {1, 2, . . . , |V (G)|} such that the associated weight of an edge uv ∈ E(G), namely w(xy) = f(x) + f(y), has distinct weight.
Brian Juned Septory   +4 more
openaire   +1 more source

On the RACN of the comb product of the cycle C_3 with path P_n and broom Br_(n,m)

open access: yesJournal Focus Action of Research Mathematic
The combination of rainbow coloring and anti-magic labeling is known as Rainbow Antimagic Coloring (RAC). The Rainbow Antimagic Connection Number (RACN) of a graph G is the smallest number of colors induced by all edge weights under an antimagic labeling,
Brian Juned Septory   +2 more
doaj   +1 more source
Some of the next articles are maybe not open access.

On the study of rainbow antimagic connection number of comb product of tree and complete bipartite graph

Discrete Mathematics, Algorithms and Applications, 2023
Rainbow antimagic coloring is the combination of antimagic labeling and rainbow coloring. The smallest number of colors induced from all edge weights of antimagic labeling is the rainbow antimagic connection number of [Formula: see text], denoted by [Formula: see text]. Given a graph [Formula: see text] with vertex set [Formula: see text] and edge set
B. J. Septory   +3 more
openaire   +1 more source
Home - About - Disclaimer - Privacy