Results 21 to 30 of about 112,754 (257)

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

BATAS ATAS RAINBOW CONNECTION NUMBER PADA GRAF BUCKMINSTERFULLERENE

Jurnal Matematika UNAND, 2022
Misalkan G adalah suatu graf terhubung tak trivial. Suatu pewarnaan c : E(G) → {1, 2, ..., k}, k ∈ N pada graf G adalah suatu pewarnaan sisi di G sedemikian sehingga setiap sisi bertetangga boleh berwarna sama.
Fitri - Anggalia, LYRA YULIANTI, DES WELYYANTI   +2 more
doaj   +1 more source

Template-Driven Rainbow Coloring of Proper Interval Graphs

, 2021
For efficient design of parallel algorithms on multiprocessor architectures with memory banks, simultaneous access to a specified subgraph of a graph data structure by multiple processors requires that the data items belonging to the subgraph reside in ...
Sajith Padinhatteeri, Sajal K. Das, Raji R. Pillai, Chandran, L. Sunil, Pillai, Raji R., Das, Sajal K., Pavol Hell, L. Sunil Chandran, Hell, Pavol, Padinhatteeri, Sajith   +9 more
core   +1 more source

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, Dafik, Robiatul Adawiyah, Rafiantika Megahnia Prihandini, Arika Indah Kristiana   +4 more
doaj   +1 more source

Bounds on coloring trees without rainbow paths [PDF]

Discussiones Mathematicae Graph Theory
For a graph with colored vertices, a rainbow subgraph is one where all vertices have different colors. For graph $G$, let $c_k(G)$ denote the maximum number of different colors in a coloring without a rainbow path on $k$ vertices, and $cp_k(G)$ the ...
Wayne Goddard, Tyler Herrman, Simon Hughes   +2 more
doaj   +3 more sources

RAINBOW CONNECTION PADA GRAF AMALGAMASI TANGGA SEGITIGA DIPERUMUM HOMOGEN

Jurnal Matematika UNAND, 2019
Untuk graf G terhubung dan tak trivial, dan k suatu bilangan bulat positif, misalkan c : E(G) → {1, 2, ..., k} suatu pewarnaan sisi di G, dimana sisi yang bertetangga boleh diberi warna yang sama. Suatu lintasan di G dikatakan lintasan rainbow jika tidak
Muhardiansyah Muhardiansyah, Lyra Yulianti, Admi Nazra   +2 more
doaj   +1 more source

Distance-Local Rainbow Connection Number

Discussiones Mathematicae Graph Theory, 2022
Under an edge coloring (not necessarily proper), a rainbow path is a path whose edge colors are all distinct. The d-local rainbow connection number lrcd(G) (respectively, d-local strong rainbow connection number lsrcd(G)) is the smallest number of colors
Septyanto Fendy, Sugeng Kiki A.
doaj   +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 Disconnection in Graphs

Discussiones Mathematicae Graph Theory, 2018
Let G be a nontrivial connected, edge-colored graph. An edge-cut R of G is called a rainbow cut if no two edges in R are colored the same. An edge-coloring of G is a rainbow disconnection coloring if for every two distinct vertices u and v of G, there ...
Chartrand Gary, Devereaux Stephen, Haynes Teresa W., Hedetniemi Stephen T., Zhang Ping   +4 more
doaj   +1 more source

RAINBOW CONNECTION NUMBER AND TOTAL RAINBOW CONNECTION NUMBER OF AMALGAMATION RESULTS DIAMOND GRAPH(〖Br〗_4) AND FAN GRAPH(F_3)

Barekeng, 2022
If be a graph and edge coloring of G is a function , rainbow connection number is the minimum-k coloration of the rainbow on the edge of graph G and denoted by rc(G). Rainbow connection numbers can be applied to the result of operations on some special
Sumarno Ismail, Isran K. Hasan, Tesya Sigar, Salmun K. Nasib   +3 more
doaj   +1 more source