Results 61 to 70 of about 9,657,260 (124)

Rainbow Connection Number of Graph Power and Graph Products [PDF]

Graphs and Combinatorics, 2013
15 pages.
Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy   +3 more
openaire   +3 more sources

Local strong rainbow connection number of corona product between cycle graphs

Indonesian Journal of Combinatorics, 2023
A rainbow geodesic is a shortest path between two vertices where all edges are colored differently. An edge coloring in which any pair of vertices with distance up to d, where d is a positive integer that can be connected by a rainbow geodesic is called ...
Khairunnisa N. Afifah, Kiki A. Sugeng
doaj   +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  

PENENTUAN RAINBOW CONNECTION NUMBER UNTUK AMALGAMASI GRAF LENGKAP DENGAN GRAF RODA

Jurnal Matematika UNAND, 2019
Suatu pewarnaan terhadap sisi-sisi di graf G terhubung tak trivial didefinisikan sebagai c : E(G) → {1, 2, · · · , k} untuk k ∈ N adalah suatu pewarnaan terhadap sisi-sisi di G sedemikian sehingga setiap sisi yang bertetangga boleh diberi warna yang sama.
Risya Hazani Utari, Lyra Yulianti, Syafrizal Sy   +2 more
doaj   +1 more source

Upper Bounds for the Rainbow Connection Numbers of Line Graphs [PDF]

Graphs and Combinatorics, 2011
11 ...
Xueliang Li 0001, Yuefang Sun
openaire   +4 more sources

On various (strong) rainbow connection numbers of graphs

Australas. J Comb., 2016
17 ...
Lin Chen 0013, Xueliang Li 0001, Henry Liu, Jinfeng Liu 0002   +3 more
openaire   +4 more sources

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 of Octopus Iteration Graphs

InPrime
The rainbow connection number of a graph G denoted by rc(G) is the minimum number of colors used to color the edges in G, such that every pair of vertices is connected by a path with all different colors. In 2008, Chartrand et al.
Desi Rahmadani, Adinda Evelyn Giyanatta, Dina Pratiwi, Mahmuddin Yunus, Vita Kusumasari   +4 more
doaj   +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, Salman, ANM, Bustan, Ariestha Widyastuty   +2 more
core   +1 more source

On strong rainbow connection number

, 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)$, where $d(u,v)$ is the distance between $u$ and $v$.
Li, Xueliang, Sun, Yuefang
openaire   +2 more sources