Results 81 to 90 of about 9,657,260 (124)
Rainbow Vertex-Connection and Forbidden Subgraphs
Discussiones Mathematicae Graph Theory, 2018 A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them ...
Li Wenjing, Li Xueliang, Zhang Jingshu
doaj +1 more source
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
THE RAINBOW VERTEX-CONNECTION NUMBERS OF WHEEL-SHIELD GRAPHS
BarekengLet be a nontrivial simple connected graph, be an edge of and be an integer greater than or equal to . A path of order , denoted by , is a graph whose vertices can be labelled such that .
Ratnaning Palupi, A. N. M. Salman
doaj +1 more source
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 connection numbers of line, middle, and total graphs of wheels
Electronic Journal of Graph Theory and ApplicationsAn edge-colored graph G is called rainbow connected if any two vertices in G are connected by a path whose no two edges are colored the same. The rainbow connection of G, denoted by rc(G), is the smallest number of colors needed such that G be a rainbow ...
Lyra Yulianti +2 more
doaj +1 more source
Rainbow vertex-connection number of 2-connected graphs
, 2011 The {\em rainbow vertex-connection number}, $rvc(G)$, of a connected graph $G$ is the minimum number of colors needed to color its vertices such that every pair of vertices is connected by at least one path whose internal vertices have distinct colors. In this paper we first determine the rainbow vertex-connection number of cycle $C_n$ of order $n\geq ...
Li, Xueliang, Liu, Sujuan
openaire +2 more sources
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 +2 more
core +1 more source
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 +1 more source
Rainbow Connection on Amal(Fn,xz,m) Graphs and Amal(On,xz,m) Graphs
Contemporary Mathematics and Applications (ConMathA)Coloring graph is giving a color to a set of vertices and a set of edges on a graph. The condition for coloring a graph is that each color is different for each neighboring member graph.
Muhammad Usaid Hudloir +4 more
doaj +1 more source