Results 51 to 60 of about 274,074 (298)
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
Rainbow Connection Number on Generalized Farey Graph
Asia Pacific Journal of Mathematicssemanticscholar +2 more sources
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
(1, 2)-rainbow Connection Number at Most 3 in Connected Dense Graphs
Electronic Journal of Graph Theory and Applications, 2023 Let G be an edge-colored connected graph G . A path P in the graph G is called l -rainbow path if each subpath of length at most l + 1 is rainbow. The graph G is called ( k, l ) -rainbow connected if any two vertices in G are connected by at least k ...
Trung Duy Doan, Le Thi Duyen
semanticscholar +1 more source
Rainbow Connection Number of Double Quadrilateral Snake Graph
Jurnal Matematika Statistika dan Komputasi, 2023 Let graph G = be a non trivial connected graph. A graph G with edge coloring is called a rainbow connection, if for every pair of vertices on a path has a different color.
Ervie Yuniarti Astika Mustafaputri Yuniarti +2 more
semanticscholar +1 more source
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
Graphs with Strong Proper Connection Numbers and Large Cliques
Axioms, 2023 In this paper, we mainly investigate graphs with a small (strong) proper connection number and a large clique number. First, we discuss the (strong) proper connection number of a graph G of order n and ω(G)=n−i for 1⩽i⩽3. Next, we investigate the rainbow
Yingbin Ma, Xiaoxue Zhang, Yanfeng Xue
doaj +1 more source
Rainbow Connection Number and the Number of Blocks [PDF]
Graphs and Combinatorics, 2013 7 ...
Li, Xueliang, Liu, Sujuan
openaire +3 more sources
Rainbow connection number of comb product of graphs
Electronic Journal of Graph Theory and Applications, 2022 An edge-colored graph G is called a rainbow connected if any two vertices are connected by a path whose edges have distinct colors. Such a path is called a rainbow path.
Dinny Fitriani, A. Salman, Z. Awanis
semanticscholar +1 more source
An updated survey on rainbow connections of graphs - a dynamic survey
Theory and Applications of Graphs, 2017 The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and Zhang in 2008. Nowadays it has become a new and active subject in graph theory. There is a book on this topic by Li and Sun in 2012, and a survey paper by Li, Shi and Sun in
Xueliang Li, Yuefang Sun
doaj +1 more source