Results 91 to 100 of about 15,119,957 (115)

Intelligent penetration testing method for power internet of things systems combining ontology knowledge and reinforcement learning. [PDF]

PLoS One
Sun S, Lu Y, Wu D, Zhang G.
europepmc   +1 more source

Strawberry Connection

Strawberry Connection
core  

Some of the next articles are maybe not open access.

Related searches:

Total rainbow connection numbers of some special graphs

Applied Mathematics and Computation, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yingbin Ma
exaly   +2 more sources

Rainbow Vertex Connection Numbers and Total Rainbow Connection Numbers of Middle and Total Graphs

Ars Combinatoria, 2023
A 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   +2 more sources

Total Rainbow Connection Number and Complementary Graph

Results in Mathematics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ma, Yingbin, Chen, Lily, Li, Hengzhe
openaire   +4 more sources

(Strong) Rainbow Connection Number of Line, Middle and Total Graph of Sunlet Graph

2018 IEEE International Conference on Progress in Informatics and Computing (PIC), 2018
A path is called a rainbow path if no two edges of it are colored the same. An edge-colored graph is rainbow connected if every two distinct vertices are connected by a rainbow path. The rainbow connection number of a connected graph G, denoted by rc(G), is the smallest number of colors needed to make G rainbow connected.
Yan Zhao, Shasha Li, Sujuan Liu
openaire   +1 more source

Rainbow connection number of amalgamation of some graphs [PDF]

AKCE International Journal of Graphs and Combinatorics, 2016
Let G be a nontrivial connected graph. For k∈N, we define a coloring c:E(G)→{1,2,…,k} of the edges of G such that adjacent edges can be colored the same. A path P in G is a rainbow path if no two edges of P are colored the same. A rainbow path connecting
A N M Salman
exaly   +2 more sources

Strong rainbow connection in digraphs

Discrete Applied Mathematics, 2018
International audienceAn arc-coloured digraph is strongly rainbow connected if for every pair of vertices (u, v) there exists a shortest path from u to v all of whose arcs have different colours.
Elżbieta Sidorowicz, Eric Sopena
exaly   +2 more sources

The Rainbow Connection Number of Origami Graphs and Pizza Graphs [PDF]

Procedia Computer Science, 2015
Let G = (V(G), E(G)) be a nontrivial, finite, and connected graph. Define a k-coloring c : E(G) → {1, 2, ..., n} for some n ∈ N, where two adjacent edges may have the same color. A path from u to v, denoted by u − v path, is said a u − v rainbow path, if
A N M Salman
exaly   +2 more sources

The Rainbow Connection Number of the Power Graph of a Finite Group

Graphs and Combinatorics, 2015
Min Feng, Xuanlong Ma
exaly