Results 41 to 50 of about 9,657,260 (124)
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
The (Strong) Rainbow Connection Number of Join Of Ladder and Trivial Graph
JTAM (Jurnal Teori dan Aplikasi Matematika), 2023 Let G = (V,E) be a nontrivial, finite, and connected graph. A function c from E to {1,2,...,k},k ∈ N, can be considered as a rainbow k-coloring if every two vertices x and y in G has an x- y path.
Dinda Kartika +2 more
doaj +1 more source
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
Barekeng, 2023 Rainbow antimagic coloring is a combination of antimagic labeling and rainbow coloring. Antimagic labeling is labeling of each vertex of the graph with a different label, so that each the sum of the vertices in the graph has a different weight. Rainbow
R Adawiyah +4 more
doaj +1 more source
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
On The Locating Rainbow Connection Number of A Graph [PDF]
Journal of Physics: Conference Series, 2021 AbstractLetkbe a positive integer andG= (V(G),E(G)) be a finite and connected graph. A rainbow vertexk-coloring ofGis a functionc:V(G) → {1,2,…,k} such that for every two verticesuandvinV(G) there exists au-vpath whose internal vertices have distinct colors. Such path is called a rainbow vertex path.
Ariestha Widyastuty Bustan +2 more
openaire +1 more source
On the Rainbow Connection Number for Snowflake Graph [PDF]
, 2023 Let G be an arbitrary non-trivial connected graph. An edge-colored graph G is called a rainbow connected if any two vertices are connected by a path whose edges have distinct colors, such path is called a rainbow path.
Yulianti, Lyra +3 more
core +1 more source
Rainbow connection number and graph operations
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hengzhe Li, Yingbin Ma
openaire +1 more source