Results 31 to 40 of about 9,657,260 (124)
Rainbow Connection Number and Connectivity [PDF]
The Electronic Journal of Combinatorics, 2012 The rainbow connection number, $rc(G)$, of a connected graph $G$ is the minimum number of colors needed to color its edges, so that every pair of vertices is connected by at least one path in which no two edges are colored the same. Our main result is that $rc(G)\leq \lceil\frac{n}{2}\rceil$ for any 2-connected graph with at least three vertices.
Xueliang Li 0001 +4 more
openaire +3 more sources
Rainbow Connection Number and Radius [PDF]
Graphs and Combinatorics, 2012 The rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to colour its edges, so that every pair of its vertices is connected by at least one path in which no two edges are coloured the same. In this note we show that for every bridgeless graph G with radius r, rc(G) <= r(r + 2).
Manu Basavaraju +3 more
openaire +3 more sources
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
Rainbow Connection Number of Double Quadrilateral Snake Graph [PDF]
, 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.
Massalesse, Jusmawati +2 more
core +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 +4 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