Results 61 to 70 of about 274,074 (298)

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

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

Rainbow Vertex-Connection Number [PDF]

, 2012
All the above parameters on rainbow connections involved edge-colorings of graphs. A natural idea is to introduce a similar parameter involving vertex-colorings of graphs. It is, as mentioned above, a vertex version of the rainbow connection number. Krivelevich and Yuster (J.
Xueliang Li, Yuefang Sun
openaire   +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

The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths

Electronic Journal of Graph Theory and Applications, 2020
An edge-colored graph G is rainbow k-connected, if there are k-internally disjoint rainbow paths connecting every pair of vertices of G. The rainbow k-connection number of G, denoted by rck(G), is the minimum number of colors needed for which there ...
Bety Hayat Susanti, A.N.M. Salman, Rinovia Simanjuntak   +2 more
doaj   +1 more source

Rainbow Connection In Sparse Graphs

Discussiones Mathematicae Graph Theory, 2013
An edge-coloured connected graph G = (V,E) is called rainbow-connected if each pair of distinct vertices of G is connected by a path whose edges have distinct colours. The rainbow connection number of G, denoted by rc(G), is the minimum number of colours
Kemnitz Arnfried, Przybyło Jakub, Schiermeyer Ingo, Woźniak Mariusz   +3 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

Generalized Rainbow Connection of Graphs and their Complements

Discussiones Mathematicae Graph Theory, 2018
Let G be an edge-colored connected graph. A path P in G is called ℓ-rainbow if each subpath of length at most ℓ + 1 is rainbow. The graph G is called (k, ℓ)-rainbow connected if there is an edge-coloring such that every pair of distinct vertices of G is ...
Li Xueliang, Magnant Colton, Wei Meiqin, Zhu Xiaoyu   +3 more
doaj   +1 more source

Rainbow Connectivity of Cacti and of Some Infinite Digraphs

Discussiones Mathematicae Graph Theory, 2017
An arc-coloured digraph D = (V,A) is said to be rainbow connected if for every pair {u, v} ⊆ V there is a directed uv-path all whose arcs have different colours and a directed vu-path all whose arcs have different colours.
Alva-Samos Jesús, Montellano-Ballesteros Juan José   +1 more
doaj   +1 more source

On Proper (Strong) Rainbow Connection of Graphs

Discussiones Mathematicae Graph Theory, 2021
A path in an edge-colored graph G is called a rainbow path if no two edges on the path have the same color. The graph G is called rainbow connected if between every pair of distinct vertices of G, there is a rainbow path.
Jiang Hui, Li Wenjing, Li Xueliang, Magnant Colton   +3 more
doaj   +1 more source