Results 31 to 40 of about 15,119,957 (115)

On the total rainbow connection of the wheel related graphs

, 2018
IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018)Let G = (V (G); E(G)) be a nontrivial connected graph with an edge coloring c : E(G) ! f1; 2; :::; lg; l 2 N, with the condition that the adjacent edges may be colored by the same colors.
Alfarisi, Ridho, M.S Hasan, Slamin, Slamin, Agustin, Ika Hesti, Dafik, Dafik   +4 more
core  

Rainbow Connection Number Pada Operasi Graf [PDF]

, 2014
An edge-colouring of a graph $G$ is rainbow connected if  there are $k$ internally vertex-disjoint paths joining them, with no two edges on the path have the same color.
Yulianti S, Arnasyitha, Dafik, Dafik
core  

Rainbow Connection Number of Special Graph and Its Operations [PDF]

, 2014
Let $G$ be a simple graph. An edge-coloring of a graph $G$ is rainbow connected if, for any two vertices of $G$, there are $k$ internally vertex-disjoint paths joining them, each of which is rainbow and then a minimal numbers of color $G$ is required to ...
Nastiti, Artanty, Dafik, Dafik
core  

Rainbow Connection Number of Prism and Product of Two Graphs [PDF]

, 2014
An edge-colouring of a graph $G$ is rainbow connected if, for any two vertices of $G$, there are $k$ internally vertex-disjoint paths joining them, each of which is rainbow and then a minimal numbers of color $G$ is required to make rainbow connected ...
Darmawan, Randhi N., Dafik, Dafik
core  

On the rainbow vertex connection number of general unicyclic graphs

In a graph G, the distance between any two vertices is defined as the length of the shortest path connecting them. A path in G is termed rainbow vertex-connected if all internal vertices along the path have distinct colors.
Alfarisi, Ridho, Kristiana, Arika Indah, Said Husain, Sharifah Kartini   +2 more
core   +1 more source

Oriented diameter and rainbow connection number of a graph

, 2014
The oriented diameter of a bridgeless graph G is min{diam(H) | H is a strang orientation of G}. A path in an edge-colored graph G, where adjacent edges may have the same color, is called rainbow if no two edges of the path are colored the same.
Li, Xueliang, Huang, Xiaolong, Xueliang Li, Li, Hengzhe, Sun, Yuefang, Hengzhe Li, Yuefang Sun, Xiaolong Huang   +7 more
core   +1 more source

Rainbow connections 2016 fall concert

, 2016
Piero UmilianiBobby McFerrinBruno Marsarr.

core  

ANALISA RAINBOW CONNECTION DAN STRONG RAINBOW CONNECTION PADA GRAF HASIL OPERASI

, 2016
Salah satu teori yang dikembangkan dalam teori graf adalah rainbow connection dan strong rainbow connection. Rainbow connection adalah pemberian warna pada sisi graf dengan syarat dua sisi yang bertetangga boleh diberi warna yang sama. Namun sisi yang
Hasan, Mokhamad Saiful
core  

Rainbow Connection Number pada Graf (tKn*Wn,v), untuk t ≥ 1 dan n ≥ 3 [PDF]

, 2018
Konsep dari rainbow connection diperkenalkan oleh Chartrand pada tahun 2008. Misalkan G adalah graf terhubung tak trivial, didefinisikan c : E(G)! f1; 2; : : : ; kg untuk k 2 N adalah suatu pewarnaan terhadap sisi-sisi di G sedemikian sehingga setiap ...
-, FADILLAH
core  

The hitting time of rainbow connection number two

, 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 ...
Heckel, A, Riordan, O
core   +1 more source