Results 261 to 270 of about 101,755 (296)

Proceedings of the Summit for Perinatal Excellence 2025. [PDF]

BMC Proc
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Rainbow Vertex Connection Numbers and Total Rainbow Connection Numbers of Middle and Total Graphs

Ars Combinatoria, 2023
A 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   +1 more source

Total Rainbow Connection Number and Complementary Graph

Results in Mathematics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ma, Yingbin, Chen, Lily, Li, Hengzhe
openaire   +4 more sources

Rainbow 2-Connection Numbers of Cayley Graphs

Information Processing Letters, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lu, Zaiping, Ma, Yingbin
openaire   +2 more sources

Rainbow connection number of rocket graphs

AIP Conference Proceedings, 2015
All graphs in this paper are simple, finite, and undirected. The concept of rainbow coloring was introduced by Chartrand et al2. Let G be a non trivial connected graph. For k∈ℕ, we define a coloring c:E(G)→{1,2,…,k} of the edges of G such that the adjacent can be colored the same.
null Susilawati, A. N. M. Salman
openaire   +1 more source

Rainbow Connection Number in Pyramid Networks

Proceedings of the 11th International Conference on Computer Modeling and Simulation, 2019
Rainbow connection number of a connected graph G is the minimum number of colors needed to color the edges of G, so that every pair of vertices is connected by at least one path whose edges have distinct colors. In this paper, we propose a linear time algorithm for constructing a rainbow coloring on pyramids.
Fu-Hsing Wang, Cheng-Ju Hsu
openaire   +1 more source

Rainbow connection numbers of Cayley graphs

Journal of Combinatorial Optimization, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ma, Yingbin, Lu, Zaiping
openaire   +2 more sources

Upper Bounds for Rainbow Connection Numbers

2012
From Chap. 2, we know that it is almost impossible to give the precise value of the rainbow connection number for a given arbitrary graph. This suggests the problem of determining bounds of it, especially sharp upper bounds. In this chapter, we survey many upper bounds for the rainbow connection numbers in terms of other graph parameters, such as ...
Xueliang Li, Yuefang Sun
openaire   +1 more source

A mathematical model for finding the rainbow connection number

2013 7th International Conference on Application of Information and Communication Technologies, 2013
The rainbow connection problem belongs to the class of NP-Hard graph theoretical problems. The rainbow connection of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow edge-connected. In this study, we present a new mathematical model for the rainbow connection problem.
Nuriyeva, Fidan, Ugurlu, Onur, Kutucu, Hakan   +2 more
openaire   +3 more sources

Graphs with vertex rainbow connection number two

Science China Mathematics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lu, ZaiPing, Ma, YingBin
openaire   +2 more sources