Results 31 to 40 of about 9,667,141 (66)

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

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

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, Liu, Mengmeng, Schiermeyer, Ingo   +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  

Rainbow connection number of amalgamation of some graphs [PDF]

, 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, Salman, A.N.M., Fitriani, D.   +3 more
core   +1 more source

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  

Local antimagic chromatic number of partite graphs [PDF]

, 2023
Let $G$ be a connected graph with $|V| = n$ and $|E| = m$. A bijection $f:E\rightarrow \{1,2,...,m\}$ is called a local antimagic labeling of $G$ if for any two adjacent vertices $u$ and $v$, $w(u) \neq w(v)$, where $w(u) = \sum_{e \in E(u)}f(e)$, and $E(
Pavithra, C. R., Prajeesh, A. V., Sarath, V. S.   +2 more
core  

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, Salman, ANM, Bustan, Ariestha Widyastuty   +2 more
core   +1 more source

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