Results 21 to 30 of about 15,119,957 (115)
The Rainbow (Vertex) Connection Number of Pencil Graphs [PDF]
, 2015 An edge colored graph G = (V(G), E(G)) is said rainbow connected, if any two vertices are connnected by a path whose edges have distinct colors. The rainbow connection number of G, denoted by rc(G), is the smallest positive integer of colors needed in ...
Simamora, Dian N.S., Salman, A.N.M.
core +1 more source
BATAS ATAS RAINBOW CONNECTION NUMBER UNTUK DUA JENIS GRAF BUCKMINSTERFULLERENE [PDF]
, 2021 Misalkan G adalah suatu graf terhubung tak trivial. Suatu pewarnaan c : E(G) → {1, 2, ..., k}, k ∈ N pada graf G adalah suatu pewarnaan sisi di G sedemikian sehingga setiap sisi bertetangga boleh berwarna sama.
FITRI, ANGGALIA
core +1 more source
On the Locating Rainbow Connection Number of Trees and Regular Bipartite Graphs [PDF]
, 2023 Locating the rainbow connection number of graphs is a new mathematical concept that combines the concepts of the rainbow vertex coloring and the partition dimension.
Putri, Pritta E. +7 more
core +1 more source
Determining the Locating Rainbow Connection Number of Vertex-Transitive Graphs [PDF]
The locating rainbow connection number of a graph is defined as the minimum number of colors required to color vertices such that every two vertices there exists a rainbow vertex path and every vertex has a distinct rainbow code.
Putri, Pritta Etriana +2 more
core +1 more source
Bounds for the rainbow connection number of graphs [PDF]
, 2011 An edge-coloured graph G is rainbow-connected if any two vertices are connected by a path whose edges have distinct colours. The rain-bow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order ...
Ingo Schiermeyer, Schiermeyer, Ingo
core +1 more source
Rainbow Connection Number of Dense Graphs [PDF]
, 2013 An edge-colored graph $G$ is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph $G$, denoted $rc(G)$, is the smallest number of colors that are needed in ...
Li, Xueliang +2 more
core +1 more source
Rainbow connection in graphs [PDF]
, 2011 Diplomska naloga obravnava števila mavrične in krepke mavrične povezanosti v grafih. Na začetku predstavimo osnovne pojme teorije grafov, ki so potrebni za razumevanje nadaljne snovi.
Pišek, Jasmina
core
ANALISIS RAINBOW CONNECTION NUMBER PADA GRAF KHUSUS DAN HASIL OPERASINYA [PDF]
, 2015 Misalkan G adalah graf terhubung nontrivial dengan edge ¡ coloring c : E(G) ! f1; 2; 3; :::; kg dengan k 2 N, dan mungkin terdapat pewarnaan sisi yang sama pada dua sisi yang bertetangga. Suatu lintasan u ¡ v di G merupakan rainbow path jika tidak ada
Darmawan, Randhi Nanang
core
Rainbow connection number graf lintasan, graf tangga, dan hasil perkaliannya [PDF]
, 2018 INDONESIA: Misalkan G adalah graf terhubung tak trivial. Didefinisikan pewarnaan sisi c∶E(G)→{1,2,…,k},k∈N adalah pewarnaan sedemikian sehingga setiap sisi bertetangga mungkin memiliki warna yang sama. Misalkan u,v∈V(G) dan P adalah lintasan dari u ke
Barroh, Lu’lu’ul
core
Rainbow and strong rainbow connection number for some families of graphs
, 2020 Let G be a nontrivial connected graph. Then G is called a rainbow connected graph if there exists a coloring c : E(G) → {1, 2, ..., k}, k ∈ N, of the edges of G, such that there is a u − v rainbow path between every two vertices of G, where a path P in G
Siddiqui, Muhammad Kamran +3 more
core +1 more source