Results 131 to 140 of about 303 (159)
A stargate mechanism of Microviridae genome delivery unveiled by cryogenic electron tomography
Bardy P +16 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Rainbow and Monochromatic Vertex-connection of Random Graphs
Acta Mathematicae Applicatae Sinica, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Wen-jing, Jiang, Hui, He, Jia-bei
exaly +2 more sources
Graphs with vertex rainbow connection number two
Science China Mathematics, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zai Ping Lu, Yingbin Ma
exaly +3 more sources
Strong rainbow vertex-connection of cubic graphs
2015 IEEE 9th International Conference on Intelligent Systems and Control (ISCO), 2015The 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.Annammal Arputhamary, M.Helda Mercy
exaly +2 more sources
Rainbow Vertex Connection Numbers and Total Rainbow Connection Numbers of Middle and Total Graphs
Ars Combinatoria, 2023A 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
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.
Yingbin Ma, Yanfeng Xue, Xiaoxue Zhang
openaire +1 more source
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.
Yingbin Ma, Yanfeng Xue, Xiaoxue Zhang
openaire +1 more source
Rainbow vertex-connection and graph products
International Journal of Computer Mathematics, 2015A 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 +3 more
openaire +1 more source
The 3-Vertex-Rainbow Index of 2-(Edge) Connected Graphs
Journal of Interconnection Networks, 2022Let [Formula: see text] be a vertex-colored graph. For a vertex set [Formula: see text] of at least two vertices, a tree [Formula: see text] that connects [Formula: see text] in [Formula: see text] is vertex-rainbow if no two vertices of [Formula: see text] have the same color, such a tree is called a vertex-rainbow [Formula: see text]-tree or a vertex-
Yingbin Ma, Wenhan Zhu
openaire +1 more source
Rainbow vertex connection number of square, glue, middle and splitting graph of brush graph
AIP Conference Proceedings, 2020A 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 +3 more
openaire +1 more source
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
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