Results 41 to 50 of about 5,748 (282)
Jambura Journal of Mathematics, 2022 Rainbow vertex-connection number is the minimum k-coloring on the vertex graph G and is denoted by rvc(G). Besides, the rainbow-vertex connection number can be applied to some special graphs, such as prism graph and path graph.
Indrawati Lihawa +5 more
doaj +1 more source
An Algebraic Characterization of Rainbow Connectivity [PDF]
, 2012 The use of algebraic techniques to solve combinatorial problems is studied in this paper. We formulate the rainbow connectivity problem as a system of polynomial equations. We first consider the case of two colors for which the problem is known to be hard and we then extend the approach to the general case.
Ananth, Prabhanjan, Dukkipati, Ambedkar
openaire +3 more sources
Rainbow connection number of Cm o Pn and Cm o Cn
Indonesian Journal of Combinatorics, 2020 Let G = (V(G),E(G)) be a nontrivial connected graph. A rainbow path is a path which is each edge colored with different color. A rainbow coloring is a coloring which any two vertices should be joined by at least one rainbow path.
Alfi Maulani +3 more
doaj +1 more source
Generalized rainbow connectivity of graphs
Theoretical Computer Science, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kei Uchizawa +3 more
openaire +2 more sources
The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths
Electronic Journal of Graph Theory and Applications, 2020 An edge-colored graph G is rainbow k-connected, if there are k-internally disjoint rainbow paths connecting every pair of vertices of G. The rainbow k-connection number of G, denoted by rck(G), is the minimum number of colors needed for which there ...
Bety Hayat Susanti +2 more
doaj +1 more source
Rainbow Connection Number and Connected Dominating Sets [PDF]
Electronic Notes in Discrete Mathematics, 2011 AbstractThe rainbow connection number of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on n vertices with minimum degree δ, the rainbow connection number ...
L. Sunil Chandran +3 more
openaire +4 more sources
ANALISA RAINBOW CONNECTION DAN STRONG RAINBOW CONNECTION PADA GRAF HASIL OPERASI [PDF]
, 2016 Salah satu teori yang dikembangkan dalam teori graf adalah rainbow connection dan strong rainbow connection. Rainbow connection adalah pemberian warna pada sisi graf dengan syarat dua sisi yang bertetangga boleh diberi warna yang sama. Namun sisi yang
Hasan, Mokhamad Saiful
core +1 more source
The Rainbow Vertex-Connection Number of Star Fan Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2018 A vertex-colored graph is said to be rainbow vertex-connected, if for every two vertices and in , there exists a path with all internal vertices have distinct colors.
Ariestha Widyastuty Bustan +1 more
doaj +1 more source
On the study of Rainbow Antimagic Coloring of Special Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . The bijective function is said to be a labeling of graph where is the associated weight for edge .
Dafik Dafik +3 more
doaj +1 more source
Bilangan Rainbow Connection dan Strong Rainbow Connection Pada Graf Jahangir J_{2,m} Untuk m≥2 [PDF]
, 2022 Misalkan G adalah graf terhubung tak trivial dan didefinisikan pewarnaan sisi apda graf G, yaitu p : E(G) -> {1,2,3,...n};n€G, dimana sisi yang bertetangga boleh bewarna sama.
RANDA, MUHAMMAD
core