Results 41 to 50 of about 96,099 (217)
Rainbow connection number of comb product of graphs
Electronic Journal of Graph Theory and Applications, 2022 An edge-colored graph G is called a rainbow connected if any two vertices are connected by a path whose edges have distinct colors. Such a path is called a rainbow path.
Dinny Fitriani +2 more
doaj +1 more source
Rainbow Connection Number and Connected Dominating Sets [PDF]
, 2010 Rainbow connection number rc(G) of a connected graph G is the minimum number of colours needed to colour the edges of G, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same.
Caro +8 more
core +1 more source
Hardness Results for Total Rainbow Connection of Graphs
Discussiones Mathematicae Graph Theory, 2016 A total-colored path is total rainbow if both its edges and internal vertices have distinct colors. The total rainbow connection number of a connected graph G, denoted by trc(G), is the smallest number of colors that are needed in a total-coloring of G ...
Chen Lily, Huo Bofeng, Ma Yingbin
doaj +1 more source
THE RAINBOW VERTEX-CONNECTION NUMBERS OF WHEEL-SHIELD GRAPHS
BarekengLet 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
Proceedings of the AAAI Conference on Artificial IntelligenceWe introduce the algorithmic problem of finding a locally rainbow path of length l connecting two distinguished vertices s and t in a vertex-colored directed graph. Herein, a path is locally rainbow if between any two visits of equally colored vertices, the path traverses consecutively at leaset r differently colored vertices.
Till Fluschnik +2 more
openaire +2 more sources
Rainbow Connection Number on Amalgamation of General Prism Graph
InPrime, 2019 Let be a nontrivial connected graph, the rainbow-k-coloring of graph G is the mapping of c: E(G)-> {1,2,3,…,k} such that any two vertices from the graph can be connected by a rainbow path (the path with all edges of different colors).
Rizki Hafri Yandera +2 more
doaj +1 more source
Exploring Curvature Effects in Direct‐Written 3D Curved Hollow Magnetic Nanoshells
Advanced Functional Materials, EarlyView.Fabricated by a hybrid FEBID/CVD method, 3D PtC/Co3Fe core–shell heterostructures with engineered curvature and shell thickness exhibit complex reversal modes with axially symmetric N'eel‐type domain walls. XMCD‐PEEM combined with full‐scale micromagnetic simulations reveal how curvature and thickness govern the domain wall energy landscape and shape ...
Oleksii M. Volkov +10 more
wiley +1 more source
Rainbow Turán Problems for Paths and Forests of Stars
The Electronic Journal of Combinatorics, 2017 For a fixed graph $F$, we would like to determine the maximum number of edges in a properly edge-colored graph on $n$ vertices which does not contain a rainbow copy of $F$, that is, a copy of $F$ all of whose edges receive a different color. This maximum, denoted by $ex^*(n,F)$, is the rainbow Turán number of $F$, and its systematic study was initiated
Daniel Johnston +2 more
openaire +3 more sources
Rainbow Connection on Amal(Fn,xz,m) Graphs and Amal(On,xz,m) Graphs
Contemporary Mathematics and Applications (ConMathA)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 Number of Graphs with Diameter 3
Discussiones Mathematicae Graph Theory, 2017 A path in an edge-colored graph G is rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer k for which there exists a k-edge-coloring of G such that every pair of distinct vertices of G
Li Hengzhe, Li Xueliang, Sun Yuefang
doaj +1 more source