Results 11 to 20 of about 7,406 (155)

Rainbow vertex connection of digraphs [PDF]

Journal of Combinatorial Optimization, 2017
An edge-coloured path is rainbow if its edges have distinct colours. An edge-coloured connected graph is said to be rainbow connected if any two vertices are connected by a rainbow path, and strongly rainbow connected if any two vertices are connected by
Yongtang Shi, Shi Yongtang
exaly   +6 more sources

The Rainbow Vertex-Connection Number of Star Fan Graphs [PDF]

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, A.N.M. Salman   +1 more
doaj   +3 more sources

Analisis Rainbow Vertex Connection pada Beberapa Graf Khusus dan Operasinya

CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS, 2016
Suppose $G=(V(G),E(G))$ is a non-trivial connected graph with edge coloring defined as $c:E(G) \rightarrow \{1,2,...,k\} ,k \in N$, with the condition that neighboring edges can be the same color.
Ida Ariska
semanticscholar   +4 more sources

The Rainbow Vertex Connection Number of Some Amalgamation of Two Cycles

Tensor: Pure and Applied Mathematics Journal
This paper focuses on rainbow vertex coloring in a graph G, in which, for every two vertices in G, there exists a rainbow vertex path where all internal vertices have distinct colors.
Pranaya D. M. Taihuttu, M. Tilukay, F. Y. Rumlawang, E. M. C. Wattimena   +3 more
semanticscholar   +3 more sources

A Study on Strong Rainbow Vertex-Connection in Some Classes of Generalized Petersen Graphs

Procedia Computer Science, 2020
In a vertex colored graph G, a rainbow path is defined as a path in which all the internal vertices get different colors. The graph G is called a strongly rainbow vertex-connected graph, if at least one shortest rainbow path exists between every pair of ...
M HeldaMercy, I. Arputhamary
exaly   +3 more sources

THE LOCATING RAINBOW CONNECTION NUMBERS OF LOLLIPOP AND BARBELL GRAPHS

Barekeng
The concept of the locating rainbow connection number of a graph is an innovation in graph coloring theory that combines the concepts of rainbow vertex coloring and partition dimension on graphs.
Ariestha Widyastuty Bustan, Taufan Talib, Novita Serly Laamena, Lamanisa Rasid Saputra, Nurhayati Nurhayati   +4 more
doaj   +4 more sources

Rainbow connections of bioriented graphs [PDF]

Heliyon
For a directed graph D, it's deemed rainbow connected if each arc is assigned a different color, so that all paths from the vertex u to the vertex v are rainbow connected.
Linlin Wang, Sujuan Liu, Han Jiang
doaj   +2 more sources

Tight upper bound of the rainbow vertex-connection number for 2-connected graphs

Discrete Applied Mathematics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xueliang Li, Sujuan Liu
exaly   +3 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.
Yingbin Ma, Kairui Nie
semanticscholar   +2 more sources

The rainbow vertex connection number of ladder graphs and Roach graphs

Ceylon Journal of Science, 2023
A vertex-coloured graph G is said to be rainbow vertex-connected, if every two vertices of G are connected by a path whose internal vertices have distinct colours.
W. D. D. P. Dewananda, K. Perera
semanticscholar   +2 more sources