Results 41 to 50 of about 7,406 (155)
(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-coloured 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 pairwise
Trung Duy Doan, Le Thi Duyen
doaj +1 more source
The rainbow connection problem: Mathematical formulations
, 2016 The concept of rainbow connection was introduced by Chartrand et al. in 2008. The rainbow connection number, rc(G), of a connected graph G = (V, E) is the minimum number of colors needed to color the edges of E, so that each pair of the vertices in V is ...
Kutucu H., Nuriyeva F., Ugurlu O.
core +5 more sources
Rainbow Vertex Antimagic Coloring 2-Connection paada Keluarga Graf Tangga
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS, 2022 All graph in this paper are connected graph and simple graph. Let G = (V,E)be a connected graph. Rainbow vertex connection is the assignment of G that has interior vertices with different colors.
Ahmad Musyaffa' Hikamuddin +2 more
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
The strong rainbow vertex-connection of graphs
, 2012 A vertex-colored graph $G$ is said to be rainbow vertex-connected if every two vertices of $G$ are connected by a path whose internal vertices have distinct colors, such a path is called a rainbow path. The rainbow vertex-connection number of a connected graph $G$, denoted by $rvc(G)$, is the smallest number of colors that are needed in order to make ...
Li, Xueliang, Mao, Yaping, Shi, Yongtang
openaire +2 more sources
Developing A Secure Cryptosystem with Rainbow Vertex Antimagic Coloring of Cycle Graph
, 2022 An edge labeling of graph G is a function g from the edge set of graph G to the first natural numbers up to the number of the edge set. Graph G admits a rainbow vertex antimagic coloring if, for any two vertices, there is a path with different colors of ...
Marsidi, Marsidi
core +1 more source
Rainbow connection number of generalized composition
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a connected graph with . The rainbow connection number is the smallest for which there is a map such that any two vertices can be connected by a path whose edge colors are all distinct.
Fendy Septyanto, Kiki Ariyanti Sugeng
doaj +1 more source
Static and dynamic properties of the pion from continuum modelling of strong QCD [PDF]
, 2010 We present nonperturbative numerical solutions for the quark propagator Schwinger-Dyson equation (SDE) and pseudoscalar meson Bethe-Salpeter equation (BSE) at and beyond the rainbow-ladder truncation level of this system of equations.
Cobos-Martinez, Jesus Javier +1 more
core
On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs [PDF]
, 2022 Given a graph and a colouring of its vertices, a rainbow vertex path is a path between two vertices such that all the internal nodes of the path are coloured distinctly.
Lima, Paloma T. +2 more
core +1 more source
Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes [PDF]
, 2020 Given a vertex-colored graph, we say a path is a rainbow vertex path if all its internal vertices have distinct colors. The graph is rainbow vertex-connected if there is a rainbow vertex path between every pair of its vertices.
Lima, Paloma T. +4 more
core +2 more sources