Results 31 to 40 of about 289,295 (264)
The hitting time of rainbow connection number two [PDF]
The Electronic Journal of Combinatorics, 2012 In a graph $G$ with a given edge colouring, a rainbow path is a path all of whose edges have distinct colours. The minimum number of colours required to colour the edges of $G$ so that every pair of vertices is joined by at least one rainbow path is ...
Heckel, Annika, Riordan, Oliver
core +4 more sources
Rainbow Connection Numbers of WK-Recursive Networks and WK-Recursive Pyramids
MathematicsAn edge coloring of a graph G results in G being rainbow connected when every pair of vertices is linked by a rainbow path. Such a path is defined as one where each edge possesses a distinct color.
Fu-Hsing Wang, Cheng-Ju Hsu
doaj +3 more sources
Total Rainbow Connection Number Of Shackle Product Of Antiprism Graph (〖AP〗_3)
Jurnal Matematika Statistika dan Komputasi, 2023 Function if is said to be k total rainbows in , for each pair of vertex there is a path called with each edge and each vertex on the path will have a different color.
Melisa Huntala +2 more
semanticscholar +1 more source
Rainbow Connection Number and the Number of Blocks [PDF]
Graphs and Combinatorics, 2013 7 ...
Xueliang Li 0001, Sujuan Liu
openaire +3 more sources
Barekeng, 2023 Rainbow vertex-connection number is the minimum colors assignment to the vertices of the graph, such that each vertex is connected by a path whose edges have distinct colors and is denoted by .
Nisky Imansyah Yahya +3 more
doaj +1 more source
On the locating rainbow connection number of amalgamation of complete graphs
Journal of Physics: Conference Series, 2023 Locating rainbow connection number determines the minimum number of colors connecting any two vertices of a graph with a rainbow vertex path and also verifies that the given colors produce a different rainbow code for each vertex.
A. W. Bustan, A. Salman, P. E. Putri
semanticscholar +1 more source
Rainbow connection and strong rainbow connection number on the corona product of sandat graphs
AIP Conference ProceedingsAinin Yusri Saputri +2 more
semanticscholar +2 more sources
On the Locating Rainbow Connection Number of Trees and Regular Bipartite Graphs
Emerging Science Journal, 2023 Locating the rainbow connection number of graphs is a new mathematical concept that combines the concepts of the rainbow vertex coloring and the partition dimension.
A. W. Bustan +3 more
semanticscholar +1 more source
Rainbow Connection Number and Independence Number of a Graph [PDF]
Graphs and Combinatorics, 2016 Let $G$ be an edge-colored connected graph. A path of $G$ is called rainbow if its every edge is colored by a distinct color. $G$ is called rainbow connected if there exists a rainbow path between every two vertices of $G$. The minimum number of colors that are needed to make $G$ rainbow connected is called the rainbow connection number of $G$, denoted
Jiuying Dong, Xueliang Li 0001
openaire +3 more sources
On Rainbow Vertex Antimagic Coloring of Graphs: A New Notion
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2021 All graph in this paper are simple, finite, and connected. Let be a labeling of a graph . The function is called antimagic rainbow edge labeling if for any two vertices and , all internal vertices in path have different weight, where the weight of ...
Marsidi Marsidi +3 more
doaj +1 more source