Results 141 to 150 of about 9,765,356 (168)

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

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

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

The complexity of determining the rainbow vertex-connection of a graph [PDF]

Theoretical Computer Science, 2011
A vertex-colored graph is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevich and Yuster.
Yongtang Shi, Lily Chen, Xueliang Li
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Rainbow vertex-connection and graph products

International Journal of Computer Mathematics, 2016
Yaping Mao, Chengfu Ye
exaly   +2 more sources

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

J. Interconnect. 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   +1 more source

Rainbow vertex connection number of square, glue, middle and splitting graph of brush graph

THE 4TH INDOMS INTERNATIONAL CONFERENCE ON MATHEMATICS AND ITS APPLICATION (IICMA 2019), 2020
A vertex-colored graph G = (V(G), E(G)) is said a rainbow vertex-connected, if for every two vertices u and v in V(G), there exist a u−v path with all internal vertices have distinct colors.
H. Helmi, Brella Glysentia Vilgalita, Fransiskus Fran, D. R. Putra   +3 more
semanticscholar   +1 more source

Rainbow Vertex Connection Number of Broom Graph, Triangular Book Graph and Triangular Book with Bookmark

International journal of research and innovation in applied science
The Rainbow Vertex Connection Number of a graph is the minimum number of colors required to make a graph rainbow vertex connected. A graph is said to be a rainbow vertex connected if there exists a rainbow vertex path between every pair of distinct ...
V. Jothika, P. Mythili
semanticscholar   +1 more source

The rainbow vertex connection number of star wheel graphs

INTERNATIONAL CONFERENCE ON SCIENCE AND APPLIED SCIENCE (ICSAS) 2019, 2019
A vertex-colored graph G = (V(G), E(G)) is said to be rainbow vertex-connected, if for every two vertices u and v in V(G), there exists a u – v path with all internal vertices have distinct colors.
A. W. Bustan, A. Salman
semanticscholar   +1 more source