Results 21 to 30 of about 274,074 (298)
Total Rainbow Connection Number of Corona Product of Book Graph(Bn) and Pencil Graf(Pcm)
Sainsmat, 2023 Let G be a simple and finite graph. Rainbow connection and total rainbow connection c are set c : G → {1,2,. . . , k} where k is the minimal color on graph G. A rainbow connection number(rc) is a pattern by giving different colors to the connection edges
Randi Mooduto +2 more
openalex +3 more sources
Total Rainbow Connection Number Of Shackle Product Of Antiprism Graph (〖AP〗_3)
Jurnal Matematika Statistika dan Komputasi, 2023 Function if is said to be k total rainbows in , for each pair of vertex there is a path called with each edge and each vertex on the path will have a different color.
Melisa Huntala +2 more
openalex +3 more sources
Rainbow connection number, bridges and radius [PDF]
Graphs and Combinatorics, 2011 Let $G$ be a connected graph. The notion \emph{the rainbow connection number $rc(G)$} of a graph $G$ was introduced recently by Chartrand et al. Basavaraju et al.
Dong, Jiuying, Li, Xueliang
core +2 more sources
The Rainbow Vertex-Connection Number of Star Fan Graphs [PDF]
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2018 A vertex-colored graph is said to be rainbow vertex-connected, if for every two vertices and in , there exists a path with all internal vertices have distinct colors.
Ariestha Widyastuty Bustan +1 more
doaj +2 more sources
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 +2 more sources
On strong rainbow connection number [PDF]
, 2010 A path in an edge-colored graph, where adjacent edges may be colored the same, is a rainbow path if no two edges of it are colored the same. For any two vertices $u$ and $v$ of $G$, a rainbow $u-v$ geodesic in $G$ is a rainbow $u-v$ path of length $d(u,v)
Li, Xueliang, Sun, Yuefang
core +2 more sources
Rainbow connections of bioriented graphs [PDF]
HeliyonFor 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.
Linlin Wang, Sujuan Liu, Han Jiang
doaj +2 more sources
On d-local strong rainbow connection number of prism graphs [PDF]
, 2021 A u − ν rainbow path is a path that connects two vertices u and ν in a graph G and every edge in that path has a different color. A connected graph G is called a rainbow graph if there is a rainbow path for every pair of vertices in G.
Endiyanto W Nugroho +1 more
openalex +2 more sources
Rainbow vertex-connection number of 2-connected graphs [PDF]
, 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 ...
Xueliang Li, Sujuan Liu
openalex +3 more sources
Rainbow connection number of amalgamation of some graphs
AKCE International Journal of Graphs and Combinatorics, 2016 Let G be a nontrivial connected graph. For k∈N, we define a coloring c:E(G)→{1,2,…,k} of the edges of G such that adjacent edges can be colored the same. A path P in G is a rainbow path if no two edges of P are colored the same. A rainbow path connecting
D. Fitriani, A.N.M. Salman
doaj +2 more sources