Rainbow vertex-connection number

Results 151 to 160 of about 9,765,356 (168)

Some of the next articles are maybe not open access.

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

J. Interconnect. 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.
Ying-Bin Ma, Yanfeng Xue, Xiaoxue Zhang
semanticscholar +1 more source

On rainbow vertex anti-magic coloring of amalgamation graphs

Journal of Discrete Mathematical Sciences and Cryptography
A rainbow vertex anti-magic coloring represents a relatively new area of exploration in graph theory. This concept extends the idea of rainbow vertex coloring by incorporating elements of anti-magic labeling.
R. Alfarisi +3 more
semanticscholar +1 more source

Rainbow Vertex Connection Number of a Class of Triangular Snake Graph

, 2020
Dharamvirsinh Parmar, B. Suthar
semanticscholar +1 more source

Strong rainbow vertex-connection number of comb product of a path and a connected graph