Results 71 to 80 of about 9,657,260 (124)

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, Yanne Irene, Wisnu Aribowo   +2 more
doaj   +1 more source

Rainbow connection number graf lintasan, graf tangga, dan hasil perkaliannya [PDF]

, 2018
INDONESIA: Misalkan G adalah graf terhubung tak trivial. Didefinisikan pewarnaan sisi c∶E(G)→{1,2,…,k},k∈N adalah pewarnaan sedemikian sehingga setiap sisi bertetangga mungkin memiliki warna yang sama. Misalkan u,v∈V(G) dan P adalah lintasan dari u ke
Barroh, Lu’lu’ul
core  

ANALISA RAINBOW CONNECTION DAN STRONG RAINBOW CONNECTION PADA GRAF HASIL OPERASI [PDF]

, 2016
Salah satu teori yang dikembangkan dalam teori graf adalah rainbow connection dan strong rainbow connection. Rainbow connection adalah pemberian warna pada sisi graf dengan syarat dua sisi yang bertetangga boleh diberi warna yang sama. Namun sisi yang
Hasan, Mokhamad Saiful
core   +1 more source

THE LOCATING RAINBOW EDGE CONNECTION NUMBERS OF SOME GENERALIZED SUN GRAPHS

Barekeng
Throughout this paper, G denotes a finite, simple, connected, and undirected graph. The concept of the locating rainbow edge connection number is motivated by the concept of the locating rainbow connection number in which the coloring is assigned to ...
Muhammad Ahnaf Yusuf, A. N. M. Salman, Mukayis Mukayis   +2 more
doaj   +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

Rainbow and strong rainbow connection number for some families of graphs

, 2020
Let G be a nontrivial connected graph. Then G is called a rainbow connected graph if there exists a coloring c : E(G) → {1, 2, ..., k}, k ∈ N, of the edges of G, such that there is a u − v rainbow path between every two vertices of G, where a path P in G
Siddiqui, Muhammad Kamran, Naeem, Muhammad, Farahani, Mohammad Reza, Khan, Yaqoub Ahmed   +3 more
core   +1 more source

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   +1 more source

Rainbow Total-Coloring of Complementary Graphs and Erdős-Gallai Type Problem For The Rainbow Total-Connection Number

Discussiones Mathematicae Graph Theory, 2018
A total-colored graph G is rainbow total-connected if any two vertices of G are connected by a path whose edges and internal vertices have distinct colors.
Sun Yuefang, Jin Zemin, Tu Jianhua
doaj   +1 more source

Color code techniques in rainbow connection

Electronic Journal of Graph Theory and Applications, 2018
Let G be a graph with an edge k-coloring γ : E(G) → {1, …, k} (not necessarily proper). A path is called a rainbow path if all of its edges have different colors.
Fendy Septyanto, Kiki A. Sugeng
doaj   +1 more source

Rainbow Connection Number Pada Operasi Graf [PDF]

, 2014
An edge-colouring of a graph $G$ is rainbow connected if  there are $k$ internally vertex-disjoint paths joining them, with no two edges on the path have the same color.
Yulianti S, Arnasyitha, Dafik, Dafik
core