Results 51 to 60 of about 101,543 (166)
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 +2 more
doaj +1 more source
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 +1 more source
Rainbow vertex-connection number of 2-connected graphs
, 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 ...
Li, Xueliang, Liu, Sujuan
openaire +2 more sources
Note on the upper bound of the rainbow index of a graph [PDF]
, 2014 A path in an edge-colored graph $G$, where adjacent edges may be colored the same, is a rainbow path if every two edges of it receive distinct colors. The rainbow connection number of a connected graph $G$, denoted by $rc(G)$, is the minimum number of ...
Cai, Qingqiong, Li, Xueliang, Zhao, Yan
core
Rainbow connection numbers of some graphs
Applied Mathematical Sciences, 2014 A path in an edge−colored graph is said to be a rainbow path if every edge in the path has different color. An edge colored graph is rainbow connected if there exists a rainbow path between every pair of vertices. The rainbow connection of a graph G, denoted by rc(G), is the smallest number of colors required to color the edges of graph such that the ...
Syafrizal Sy, Reni Wijaya, null Surahmat
openaire +1 more source
Rainbow Connection Number on Amalgamation of General Prism Graph
InPrime, 2019 Let be a nontrivial connected graph, the rainbow-k-coloring of graph G is the mapping of c: E(G)-> {1,2,3,…,k} such that any two vertices from the graph can be connected by a rainbow path (the path with all edges of different colors).
Rizki Hafri Yandera +2 more
doaj +1 more source
Rainbow connection number and graph operations
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Hengzhe, Ma, Yingbin
openaire +1 more source
Strong rainbow connection numbers of toroidal meshes [PDF]
Discrete Mathematics, Algorithms and Applications, 2018 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.
Wei, Yulong, Xu, Min, Wang, Kaishun
openaire +2 more sources
Note on minimally $k$-rainbow connected graphs [PDF]
, 2012 An edge-colored graph $G$, where adjacent edges may have the same color, is {\it rainbow connected} if every two vertices of $G$ are connected by a path whose edge has distinct colors.
Li, Hengzhe +3 more
core
Hardness Results for Total Rainbow Connection of Graphs
Discussiones Mathematicae Graph Theory, 2016 A total-colored path is total rainbow if both its edges and internal vertices have distinct colors. The total rainbow connection number of a connected graph G, denoted by trc(G), is the smallest number of colors that are needed in a total-coloring of G ...
Chen Lily, Huo Bofeng, Ma Yingbin
doaj +1 more source