Results 101 to 110 of about 276,819 (217)
Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph [PDF]
Lily Chen, Xueliang Li, Mengmeng Liu
openalex +1 more source
Rainbow Connection on Amal(Fn,xz,m) Graphs and Amal(On,xz,m) Graphs
Coloring graph is giving a color to a set of vertices and a set of edges on a graph. The condition for coloring a graph is that each color is different for each neighboring member graph.
Muhammad Usaid Hudloir +4 more
doaj +1 more source
The rainbow connection number of the enhanced power graph of a finite group
Luis A. Dupont +2 more
semanticscholar +1 more source
Further hardness results on the rainbow vertex-connection number of graphs [PDF]
Lily Chen, Xueliang Li, Huishu Lian
openalex +1 more source
Rainbow Connection Numbers of WK-Recursive Networks and WK-Recursive Pyramids
An edge coloring of a graph G results in G being rainbow connected when every pair of vertices is linked by a rainbow path. Such a path is defined as one where each edge possesses a distinct color.
Fu-Hsing Wang, Cheng-Ju Hsu
doaj +1 more source
Note on rainbow connection number of dense graphs [PDF]
Jiu-Ying Dong, Xueliang Li
openalex +1 more source
On the RACN of the comb product of the cycle C_3 with path P_n and broom Br_(n,m)
The combination of rainbow coloring and anti-magic labeling is known as Rainbow Antimagic Coloring (RAC). The Rainbow Antimagic Connection Number (RACN) of a graph G is the smallest number of colors induced by all edge weights under an antimagic labeling,
Brian Juned Septory +2 more
doaj +1 more source
Some Bounds on the Rainbow Connection Number of 3-, 4- and 5-connected\n Graphs [PDF]
Irene Lo
openalex +2 more sources
The rainbow connection number of enhanced power graph [PDF]
Luis A. Dupont +2 more
openalex +1 more source
Note on two results on the rainbow connection number of graphs [PDF]
Wei Li, Xueliang Li
openalex +1 more source

