Results 71 to 80 of about 101,543 (166)
THE RAINBOW VERTEX-CONNECTION NUMBERS OF WHEEL-SHIELD GRAPHS
Let be a nontrivial simple connected graph, be an edge of and be an integer greater than or equal to . A path of order , denoted by , is a graph whose vertices can be labelled such that .
Ratnaning Palupi, A. N. M. Salman
doaj +1 more source
List rainbow connection number of graphs
An edge-coloured path is rainbow if all of its edges have distinct colours. Let $G$ be a connected graph. The rainbow connection number of $G$, denoted by $rc(G)$, is the minimum number of colours in an edge-colouring of $G$ such that, any two vertices are connected by a rainbow path. The strong rainbow connection number of $G$, denoted by $src(G)$, is
Tang, Rongxia +3 more
openaire +2 more sources
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
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
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
Rainbow Connection Number of Shackle Graphs [PDF]
A.N.M. Salman +2 more
openaire +1 more source
Rainbow Connection Number of Octopus Iteration Graphs
The rainbow connection number of a graph G denoted by rc(G) is the minimum number of colors used to color the edges in G, such that every pair of vertices is connected by a path with all different colors. In 2008, Chartrand et al. first introduced the concept of rainbow connection numbers.
Desi Rahmadani +4 more
openaire +1 more source
Hõimlane verejõe tagant: Saami muinaslood tootempõhjapõdrast. VI
The sixth part is concerned with Meandash as a cultural hero (4.2) and Meandash being chased by thunder-god (4.3.1).The story of the cultural hero (story 23.; written by V.Charnolusky) reveals that Meandash has given the Lapp a bow and taught him to hunt.
Enn Ernits
doaj
RAINBOW CONNECTION NUMBER OF FLOWER SNARK GRAPH [PDF]
K. Srinivasa Rao +2 more
openaire +1 more source
Integrating biological and machine learning models for rainbow trout growth: Balancing accuracy and interpretability. [PDF]
Fulton L, Lyu P.
europepmc +1 more source

