Results 221 to 230 of about 289,295 (264)

Voltage-gated ion channels in cultured gill epithelia of rainbow trout, Oncorhynchus mykiss, change in transcript abundance with exposure to freshwater. [PDF]

Comp Biochem Physiol A Mol Integr Physiol
Gideon S, Boyd B, Ramirez Sierra B, Arenas D, Ochoa P, Eme J, Kolosov D.   +6 more
europepmc   +1 more source

Medicinal and Aromatic Plant Oils in Aquafeeds: Mechanistic Perspectives on Growth Promotion, Immunomodulation, and Stress Resilience. [PDF]

Aquac Nutr
Öz M, Üstüner E, Çifci S.
europepmc   +1 more source

SMILES: A Child-Centered OCD Recovery Model Derived Through Thematic Analysis. [PDF]

Indian J Psychol Med
Sravanti L, Pradeep A, Kommu JVS, Madegowda RK, Girimaji SC, Seshadri S.   +5 more
europepmc   +1 more source

Relationship between prenatal anxiety, depression, pregnancy stress and their social determinants. [PDF]

BMC Psychol
Meng W, Shalayiding S, Wang X, Sailike B, Jiang T.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

(1,2)-Rainbow Connection Number and Connected Dominating Sets

Journal of Interconnection Networks
In this paper, we first show that for every connected graph [Formula: see text], the [Formula: see text]-rainbow connection number [Formula: see text] is upper bounded by [Formula: see text], where [Formula: see text] is a connected two-way dominating ...
Yingbin Ma, Yuyu Zhao
semanticscholar   +2 more sources

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 ...
Jan Ekstein, Přemysl Holub, Tomáš Kaiser   +2 more
exaly   +3 more sources

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

Rainbow 2-Connection Numbers of Cayley Graphs

Information Processing Letters, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zai Ping Lu, Yingbin Ma
exaly   +3 more sources

Rainbow connection numbers of Cayley graphs

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

List rainbow connection number of graphs

Discrete Applied Mathematics
An edge-coloured path is rainbow if all of its edges have distinct colours. Let $G$ be a connected graph. The rainbow connection number of $G$, denoted by $rc(G)$, is the minimum number of colours in an edge-colouring of $G$ such that, any two vertices ...
Rongxia Tang, Henry Liu, Yueping Shi, Chenming Wang   +3 more
semanticscholar   +1 more source