Results 31 to 40 of about 1,309,904 (175)
On the inverse graph of a finite group and its rainbow connection number
Electronic Journal of Graph Theory and Applications, 2023 A rainbow path in an edge-colored graph G is a path that every two edges have different colors. The minimum number of colors needed to color the edges of G such that every two distinct vertices are connected by a rainbow path is called the rainbow ...
Rian Febrian Umbara +2 more
doaj +1 more source
The rainbow vertex connection number of ladder graphs and Roach graphs
Ceylon Journal of Science, 2023 A vertex-coloured 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 colours. The rainbow vertex-connection number of a connected graph G, denoted by rvc(G), is the smallest number of colours that are needed to make G, a rainbow vertex-connected. This study focuses on
W. D. D. P. Dewananda +1 more
openaire +1 more source
The rainbow connection number of the enhanced power graph of a finite group
Electronic Journal of Graph Theory and Applications, 2023 Let G be a finite group. The enhanced power graph ΓGe of G is the graph with vertex set G and two distinct vertices are adjacent if they generate a cyclic subgroup of G. In this article, we calculate the rainbow connection number of ΓGe.
Luis A. Dupont +2 more
doaj +1 more source
(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-Vertex Connection Number [RVCN] of Subdivision of Certain Graphs
International Journal of Scientific Research in Science, Engineering and Technology, 2022 Rainbow-Vertex Connection Number [rvcn] is computed for some graphs by the researchers. Here we have considered the subdivision graphs of certain graph classes. The rainbow edge connection number of subdivision of Triangular snake graph was already found[1].
K., Dechamma K., R., Dr. Rajanna K.
openaire +1 more source
Developing A Secure Cryptosystem with Rainbow Vertex Antimagic Coloring of Cycle Graph [PDF]
, 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 Vertex Connection Number pada Keluarga Graf Roda
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS, 2022 The rainbow vertex connection was first introduced by krivelevich and yuster in 2009 which is an extension of the rainbow connection. Let graph $G =(V,E)$ is a connected graph. Rainbow vertex-connection is the assignment of color to the vertices of a graph $G$, if every vertex on graph $G$ is connected by a path that has interior vertices with ...
Firman Firman +2 more
openaire +1 more source
Analisis rainbow vertex connection pada beberapa graf khusus dan operasinya
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS, 2021 The vertex colored graph G is said rainbow vertex cennected, if for every two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex connection number of G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertex connected.
Ida Ariska +2 more
openaire +1 more source
Vertex rainbow colorings of graphs [PDF]
, 2012 In a properly vertex-colored graph G, a path P is a rainbow path if no two vertices of P have the same color, except possibly the two end-vertices of P. If every two vertices of G are connected by a rainbow path, then G is vertex rainbow-connected.
Fujie-Okamoto, Futaba +3 more
core +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