Results 91 to 100 of about 9,657,260 (124)
Rainbow Connection Number Of Graph Power And Graph Products [PDF]
, 2011 The minimum number of colors required to color the edges of a graph so that any two distinct vertices are connected by at least one path in which no two edges are colored the same is called its rainbow connection number.
Arunselvan, R
core
Rainbow Connection Number and Radius
, 2010 Rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same.
Chandran, Sunil L +3 more
core
Rainbow vertex-connection number of 3-connected graph
Applied Mathematical Sciences, 2017 Zhiping Wang, Yixiao Liu, Xiaojing Xu
openaire +1 more source
The rainbow connection number of 2-connected graphs
Discrete Mathematics, 2013 The rainbow connection number of a graph G is the least number of colours in a (not necessarily proper) edge-colouring of G such that every two vertices are joined by a path which contains no colour twice. Improving a result of Caro et al., we prove that the rainbow connection number of every 2-connected graph with n vertices is at most the ceiling of ...
Přemysl Holub +2 more
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Rainbow Vertex Connection Numbers and Total Rainbow Connection Numbers of Middle and Total Graphs
Ars Combinatoria, 2023A vertex-colouring of a graph Γ is rainbow vertex connected if every pair of vertices ( u , v ) in Γ there is a u − v path whose internal vertices have different colours. The rainbow vertex connection number of a graph Γ , is the minimum number of colours needed to make Γ rainbow vertex connected, denoted by r v c ( Γ ) .
Yingbin Ma, Kairui Nie
openaire +2 more sources
The Rainbow Connection Number of the Power Graph of a Finite Group [PDF]
Graphs and Combinatorics, 2015 10 pages, 5 figures, accepted by Graphs and Combinatorics on July ...
Min Feng, Xuanlong Ma
exaly +3 more sources
Rainbow 2-Connection Numbers of Cayley Graphs
Information Processing Letters, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zaiping Lu
exaly +4 more sources
Strong rainbow connection in digraphs
Discrete Applied Mathematics, 2018 International audienceAn arc-coloured digraph is strongly rainbow connected if for every pair of vertices (u, v) there exists a shortest path from u to v all of whose arcs have different colours.
Elżbieta Sidorowicz, Eric Sopena
exaly +2 more sources