Results 31 to 40 of about 4,433 (166)

The (Strong) Rainbow Connection Number of Join Of Ladder and Trivial Graph

JTAM (Jurnal Teori dan Aplikasi Matematika), 2023
Let G = (V,E) be a nontrivial, finite, and connected graph. A function c from E to {1,2,...,k},k ∈ N, can be considered as a rainbow k-coloring if every two vertices x and y in G has an x- y path.
Dinda Kartika, Didi Febrian, Nurul Maulida Surbakti   +2 more
doaj   +1 more source

The Hitting Time of Rainbow Connection Number Two [PDF]

The Electronic Journal of Combinatorics, 2012
In a graph $G$ with a given edge colouring, a rainbow path is a path all of whose edges have distinct colours. The minimum number of colours required to colour the edges of $G$ so that every pair of vertices is joined by at least one rainbow path is called the rainbow connection number $\mathrm{rc}(G)$ of the graph $G$.
Heckel, A, Riordan, O
openaire   +4 more sources

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 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

Total Rainbow Connection Number of Some Graph Operations

Axioms, 2022
In a graph H with a total coloring, a path Q is a total rainbow if all elements in V(Q)∪E(Q), except for its end vertices, are assigned different colors. The total coloring of a graph H is a total rainbow connected coloring if, for any x,y∈V(H), there is
Hengzhe Li, Yingbin Ma, Yan Zhao
doaj   +1 more source

Rainbow connection number and graph operations

Discrete Applied Mathematics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hengzhe Li, Yingbin Ma
openaire   +1 more source

Rainbow connection number of Cm o Pn and Cm o Cn

Indonesian Journal of Combinatorics, 2020
Let G = (V(G),E(G)) be a nontrivial connected graph. A rainbow path is a path which is each edge colored with different color. A rainbow coloring is a coloring which any two vertices should be joined by at least one rainbow path.
Alfi Maulani, Soya Pradini, Dian Setyorini, Kiki A. Sugeng   +3 more
doaj   +1 more source

On various (strong) rainbow connection numbers of graphs [PDF]

Australas. J Comb., 2016
17 ...
Lin Chen 0013, Xueliang Li 0001, Henry Liu, Jinfeng Liu 0002   +3 more
openaire   +3 more sources