Results 51 to 60 of about 9,657,260 (124)
Rainbow Vertex-Connection Number [PDF]
All the above parameters on rainbow connections involved edge-colorings of graphs. A natural idea is to introduce a similar parameter involving vertex-colorings of graphs. It is, as mentioned above, a vertex version of the rainbow connection number. Krivelevich and Yuster (J.
Xueliang Li, Yuefang Sun
openaire +1 more source
Rainbow Connection Number dan Strong Rainbow Connection Number pada Graf komplemen dari Graf konjugasi grup dihedral [PDF]
INDONESIA: Graf G dengan pewarnaan sisi disebut rainbow connected jika setiap titik pada graf G dihubungkan oleh lintasan yang memiliki sisi-sisi dengan warna berbeda.
Indahsari, Alvi Nur Laila
core
Strong rainbow connection numbers of toroidal meshes [PDF]
In 2011, Li et al. [The (strong) rainbow connection numbers of Cayley graphs on Abelian groups, Comput. Math. Appl. 62(11) (2011) 4082–4088] obtained an upper bound of the strong rainbow connection number of an [Formula: see text]-dimensional undirected toroidal mesh. In this paper, this bound is improved.
Yulong Wei, Min Xu 0005, Kaishun Wang
openaire +3 more sources
BATAS ATAS RAINBOW CONNECTION NUMBER UNTUK DUA JENIS GRAF BUCKMINSTERFULLERENE [PDF]
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
The rainbow connection number of the enhanced power graph of a finite group
Let G be a finite group. The enhanced power graph ΓGe of G is the graph with vertex set G and two distinct vertices are adjacent if they generate a cyclic subgroup of G. In this article, we calculate the rainbow connection number of ΓGe.
Luis A. Dupont +2 more
doaj +1 more source
The rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi +3 more
doaj +1 more source
On the Locating Rainbow Connection Number of Trees and Regular Bipartite Graphs [PDF]
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
On the inverse graph of a finite group and its rainbow connection number
A rainbow path in an edge-colored graph G is a path that every two edges have different colors. The minimum number of colors needed to color the edges of G such that every two distinct vertices are connected by a rainbow path is called the rainbow ...
Rian Febrian Umbara +2 more
doaj +1 more source
On the threshold for rainbow connection number $$r$$ r in random graphs [PDF]
16 pages, 2 ...
Annika Heckel, Oliver Riordan
openaire +2 more sources
Note on Rainbow Connection in Oriented Graphs with Diameter 2
In this note, we provide a sharp upper bound on the rainbow connection number of tournaments of diameter $2$. For a tournament $T$ of diameter $2$, we show $2 \leq \overrightarrow{rc}(T) \leq 3$.
Rebecca Holliday +2 more
doaj +1 more source

