Results 11 to 20 of about 156 (148)

Analysis of Rainbow Vertex Antimagic Coloring and its Application to Cryptographic Secret Sharing with Affine Cipher Technique

JTAM (Jurnal Teori dan Aplikasi Matematika)
Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a path such that all interior vertices have distinct colors. The antimagic labeling assigns a bijective
Dafik Dafik, Iftitahul Firdausiyah, Robiatul Adawiyah, Ika Hesti Agustin, Indah Lutfiyatul Mursyidah, Marsidi Marsidi   +5 more
openaire   +3 more sources

Rainbow connections of bioriented graphs. [PDF]

Heliyon
For a directed graph D, it's deemed rainbow connected if each arc is assigned a different color, so that all paths from the vertex u to the vertex v are rainbow connected.
Wang L, Liu S, Jiang H.
europepmc   +2 more sources

On Rainbow Antimagic Coloring of Joint Product of Graphs

Cauchy: 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, Liliek Susilowati, Dafik Dafik, M. Venkatachalam   +3 more
doaj   +1 more source

Rainbow degree-jump coloring of graphs

Karpatsʹkì Matematičnì Publìkacìï, 2021
In this paper, we introduce a new notion called the rainbow degree-jump coloring of a graph. For a vertex $v\in V(G)$, let the degree-jump closed neighbourhood of a vertex $v$ be defined as $N_{deg}[v] = \{u:d(v,u)\leq d(v)\}.$ A proper coloring of a ...
E.G. Mphako-Banda, J. Kok, S. Naduvath
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 )

Barekeng, 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, I I Makhfudloh, Dafik Dafik, RM Prihandini, AC Prihandoko   +4 more
doaj   +1 more source

Rainbow vertex connection number and strong rainbow vertex connection number on slinky graph (SlnC4))

Desimal, 2021
A graph is said rainbow connected if no path has more than one vertices of the same color inside. The minimum number of colors required to make a graph to be rainbow vertex-connected is called rainbow vertex connection-number and denoted by rvc(G ...
Afifah Farhanah Akadji, Muhammad Rifai Katili, Salmun K. Nasib, Nisky Imansyah Yahya   +3 more
doaj   +1 more source

Bilangan Terhubung Titik Pelangi pada Graf Hasil Operasi Korona Graf Prisma (P_(m,2)) dan Graf Lintasan (P_3)

Jambura Journal of Mathematics, 2022
Rainbow vertex-connection number is the minimum k-coloring on the vertex graph G and is denoted by rvc(G). Besides, the rainbow-vertex connection number can be applied to some special graphs, such as prism graph and path graph.
Indrawati Lihawa, Sumarno Ismail, Isran K Hasan, Lailany Yahya, Salmun K Nasib, Nisky Imansyah Yahya   +5 more
doaj   +1 more source

On the study of Rainbow Antimagic Coloring of Special Graphs

Cauchy: 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, Riniatul Nur Wahidah, Ermita Rizki Albirri, Sharifah Kartini Said Husain   +3 more
doaj   +1 more source

Local strong rainbow connection number of corona product between cycle graphs

Indonesian Journal of Combinatorics, 2023
A rainbow geodesic is a shortest path between two vertices where all edges are colored differently. An edge coloring in which any pair of vertices with distance up to d, where d is a positive integer that can be connected by a rainbow geodesic is called ...
Khairunnisa N. Afifah, Kiki A. Sugeng
doaj   +1 more source

High Girth Hypergraphs with Unavoidable Monochromatic or Rainbow Edges

Discussiones Mathematicae Graph Theory, 2022
A classical result of Erdős and Hajnal claims that for any integers k, r, g ≥ 2 there is an r-uniform hypergraph of girth at least g with chromatic number at least k.
Axenovich Maria, Karrer Annette
doaj   +1 more source