Results 141 to 150 of about 650 (167)

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

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

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

AIP Conference Proceedings, 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. The rainbow vertex-connection number of G, denoted by rvc(G), is the smallest number of colors needed to make G rainbow vertex-connected.
Helmi Helmi, Brella Glysentia Vilgalita, Fransiskus Fran, Dany Riansyah Putra   +3 more
openaire   +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. For every pair of vertices u and v in G, if there exists such a colored u-v path, the graph is considered rainbow vertex-connected.
Ridho Alfarisi, Arika Indah Kristiana, Sharifah Kartini Said Husain   +2 more
openaire   +1 more source

Proper (Strong) Rainbow Connection and Proper (Strong) Rainbow Vertex Connection of Graphs with Large Clique Number

Journal of Interconnection Networks
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] to make [Formula: see text] rainbow vertex connected. The proper strong rainbow vertex connection number of [Formula: see text], denoted by [Formula: see text],
Yingbin Ma, Yanfeng Xue, Xiaoxue Zhang
openaire   +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 vertices.
V. Jothika, P. Mythili
openaire   +1 more source

Rainbow Vertex Connection Number of a Class of Triangular Snake Graph

2020
Dharamvirsinh Parmar, Bharat Suthar
openaire   +1 more source

Rainbow vertex connection of digraphs

Journal of Combinatorial Optimization, 2017
Yongtang Shi, Shi Yongtang
exaly  

Rainbow and Monochromatic Vertex-connection of Random Graphs

Acta Mathematicae Applicatae Sinica, 2022
exaly