Rainbow vertex connection - Open Access .click

Results 141 to 150 of about 303 (159)

Some of the next articles are maybe not open access.

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 +2 more
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 and graph products

International Journal of Computer Mathematics, 2016
Yaping Mao, Chengfu Ye
exaly

Rainbow vertex k-connection in graphs

Discrete Applied Mathematics, 2013
Angela Mestre, TERESA Sousa
exaly

The Rainbow Vertex-disconnection in Graphs

Acta Mathematica Sinica, English Series, 2020
Xue Liang Li
exaly

Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs

Applied Mathematics and Computation, 2015
Xueliang Li, Yongtang Shi
exaly

Total rainbowk-connection in graphs

Discrete Applied Mathematics, 2014
Angela Mestre, TERESA Sousa
exaly

Rainbow Vertex Connection Number of a Class of Triangular Snake Graph

2020
Dharamvirsinh Parmar, Bharat Suthar
openaire +1 more source