Results 121 to 130 of about 7,406 (155)

Using cryogenic electron microscopy methods to gain insight into structure and initial host attachment of the flagellotropic bacteriophage 7-7-1

Noteborn W, Ouyang R, Hoeksma T, Sidi Mabrouk A, Esteves N, Pelt D, Scharf B, Briegel A.   +7 more
europepmc   +1 more source

Key traits influencing the resistance of Eucalyptus camaldulensis to wind damage in coastal areas of South China. [PDF]

Front Plant Sci
Shang X, Zhang P, Li X, Wang Y, Wu Z.
europepmc   +1 more source

Effective data visualization strategies in untargeted metabolomics.

Nat Prod Rep
Mildau K, Ehlers H, Meisenburg M, Del Pup E, Koetsier RA, Torres Ortega LR, de Jonge NF, Singh KS, Ferreira D, Othibeng K, Tugizimana F, Huber F, van der Hooft JJJ.   +12 more
europepmc   +1 more source

A stargate mechanism of Microviridae genome delivery unveiled by cryogenic electron tomography

Bardy P, MacDonald CI, Kirchberger PC, Jenkins HT, Botka T, Byrom L, Alim NT, Traore DA, König HC, Nicholas TR, Chechik M, Hart SJ, Turkenburg JP, Blaza JN, Beatty JT, Fogg PC, Antson AA.   +16 more
europepmc   +1 more source

Rainbow vertex-connection number on a small-world Farey graph

AKCE International Journal of Graphs and Combinatorics, 2022
Chayapa Darayon, Wipawee Tangjai
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Rainbow and Monochromatic Vertex-connection of Random Graphs

Acta Mathematicae Applicatae Sinica, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wenjing Li, Hui Jiang, Jia-bei He
exaly   +3 more sources

Rainbow vertex-connection and graph products

International Journal of Computer Mathematics, 2016
A vertex-coloured graph G is said to be rainbow vertex-connected if every two vertices of G are connected by a path whose internal vertices have distinct colours, such a path is called a rainbow path. The rainbow vertex-connection number of a connected graph G, denoted by , is the smallest number of colours that are needed in order to make G rainbow
Yaping Mao, Chengfu Ye
exaly   +3 more sources

Strong rainbow vertex-connection of cubic graphs

2015 IEEE 9th International Conference on Intelligent Systems and Control (ISCO), 2015
The rainbow vertex - connection number, rvc(G), of a connected graph 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. Rainbow coloring has received much attention recently in the field of interconnection networks.
I. Arputhamary, M. Mercy
exaly   +3 more sources

Proper (Strong) Rainbow Connection and Proper (Strong) Rainbow Vertex Connection of Some Special Graphs

Journal of Interconnection Networks, 2023
The proper rainbow vertex connection number of [Formula: see text], denoted by [Formula: see text], is the smallest number of colors needed to properly color the vertices of [Formula: see text] so that [Formula: see text] is rainbow vertex connected. The
Yingbin Ma, Yanfeng Xue, Xiaoxue Zhang
semanticscholar   +2 more sources

On the rainbow vertex connection number of general unicyclic graphs

Journal of Discrete Mathematical Sciences & Cryptography
In a graph G, the distance between any two vertices is defined as the length of the shortest path connecting them. A path in G is termed rainbow vertex-connected if all internal vertices along the path have distinct colors.
R. Alfarisi, A. Kristiana, S. Husain
semanticscholar   +2 more sources