Results 51 to 60 of about 289,295 (264)
Rainbow Connection In Sparse Graphs
Discussiones Mathematicae Graph Theory, 2013 An edge-coloured connected graph G = (V,E) is called rainbow-connected if each pair of distinct vertices of G is connected by a path whose edges have distinct colours. The rainbow connection number of G, denoted by rc(G), is the minimum number of colours
Kemnitz Arnfried +3 more
doaj +1 more source
On The Locating Rainbow Connection Number of A Graph
, 2021 Let k be a positive integer and G = (V(G), E(G)) be a finite and connected graph. A rainbow vertex k-coloring of G is a function c: V(G) → {1,2,…, k} such that for every two vertices u and v in V(G) there exists a u-v path whose internal vertices have ...
A. W. Bustan, A. Salman, P. E. Putri
semanticscholar +1 more source
Rainbow connection number and graph operations
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hengzhe Li, Yingbin Ma
openaire +1 more source
The Rainbow Vertex-Connection Number of Star Fan Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2018 A vertex-colored graph is said to be rainbow vertex-connected, if for every two vertices and in , there exists a path with all internal vertices have distinct colors.
Ariestha Widyastuty Bustan +1 more
doaj +1 more source
On various (strong) rainbow connection numbers of graphs [PDF]
Australas. J Comb., 2016 17 ...
Lin Chen 0013 +3 more
openaire +3 more sources
On the study of Rainbow Antimagic Coloring of Special Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . The bijective function is said to be a labeling of graph where is the associated weight for edge .
Dafik Dafik +3 more
doaj +1 more source
On d-local strong rainbow connection number of prism graphs
, 2021 A u − ν rainbow path is a path that connects two vertices u and ν in a graph G and every edge in that path has a different color. A connected graph G is called a rainbow graph if there is a rainbow path for every pair of vertices in G.
E. Nugroho, K. Sugeng
semanticscholar +1 more source
Generalized Rainbow Connection of Graphs and their Complements
Discussiones Mathematicae Graph Theory, 2018 Let G be an edge-colored connected graph. A path P in G is called ℓ-rainbow if each subpath of length at most ℓ + 1 is rainbow. The graph G is called (k, ℓ)-rainbow connected if there is an edge-coloring such that every pair of distinct vertices of G is ...
Li Xueliang +3 more
doaj +1 more source
Rainbow Connectivity of Cacti and of Some Infinite Digraphs
Discussiones Mathematicae Graph Theory, 2017 An arc-coloured digraph D = (V,A) is said to be rainbow connected if for every pair {u, v} ⊆ V there is a directed uv-path all whose arcs have different colours and a directed vu-path all whose arcs have different colours.
Alva-Samos Jesús +1 more
doaj +1 more source
On Proper (Strong) Rainbow Connection of Graphs
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-colored graph G is called a rainbow path if no two edges on the path have the same color. The graph G is called rainbow connected if between every pair of distinct vertices of G, there is a rainbow path.
Jiang Hui +3 more
doaj +1 more source