Results 21 to 30 of about 4,433 (166)
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
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 +3 more
doaj +1 more source
Rainbow Connection Number, Bridges and Radius [PDF]
Graphs and Combinatorics, 2012 8 ...
Jiuying Dong, Xueliang Li 0001
openaire +2 more sources
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices.
Melissa Keranen, Juho Lauri
doaj +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
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 +2 more
doaj +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
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
On Rainbow Antimagic Coloring of Joint Product of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and .
Brian Juned Septory +3 more
doaj +1 more source