Results 61 to 70 of about 303 (159)

The rainbow vertex-index of complementary graphs

, 2015
A vertex-colored graph $G$ is \emph{rainbow vertex-connected} if two vertices are connected by a path whose internal vertices have distinct colors. The \emph{rainbow vertex-connection number} of a connected graph $G$, denoted by $rvc(G)$, is the smallest
Ye, Chengfu, Wang, Zhao, Zhang, Shumin, Yanling, Fengnan   +3 more
core  

Chasing the Rainbow Connection: Hardness, Algorithms, and Bounds [PDF]

, 2016
We study rainbow connectivity of graphs from the algorithmic and graph-theoretic points of view. The study is divided into three parts. First, we study the complexity of deciding whether a given edge-colored graph is rainbow-connected.
Lauri, Juho
core   +1 more source

Analysis of Rainbow Vertex Antimagic Coloring and its Application to Cryptographic Secret Sharing with Affine Cipher Technique [PDF]

Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Robiatul Adawiyah, Ika Hesti Agustin, Firdausiyah, Iftitahul, Dafik Dafik, Marsidi, Marsidi, Mursyidah, Indah Lutfiyatul, Marsidi Marsidi, Adawiyah, Robiatul, Iftitahul Firdausiyah, Agustin, Ika Hesti, Indah Lutfiyatul Mursyidah, Dafik, Dafik   +11 more
core   +1 more source

The n-queens completion problem. [PDF]

Res Math Sci, 2022
Glock S, Munhá Correia D, Sudakov B.
europepmc   +1 more source

ANALISIS RAINBOW DAN STRONG RAINBOW VERTEX CONNECTION PADA GRAF HASIL OPERASI COMB SISI

, 2017
nilai Rainbow Vertex Connection dan Strong Rainbow Vertex Connection pada graf hasil operasi comb sisi (a) rvc(PnDBtm) = srvc(PnDBtm) = n−2 sisi x1x2 sebagai sisi cangkok pada graf Btm (b) rvc(PnDBtm) = srvc(PnDBtm) = n−1 sisi xiuj sebagai sisi ...
Muharromah, Agustina
core  

THE LOCATING RAINBOW CONNECTION NUMBERS OF LOLLIPOP AND BARBELL GRAPHS

The concept of the locating rainbow connection number of a graph is an innovation in graph coloring theory that combines the concepts of rainbow vertex coloring and partition dimension on graphs.
Ariestha Widyastuty Bustan, Saputra, Lamanisa Rasid, Nurhayati Nurhayati, Nurhayati, Nurhayati, Bustan, Ariestha Widyastuty, Laamena, Novita Serly, Talib, Taufan, Taufan Talib, Novita Serly Laamena, Lamanisa Rasid Saputra   +9 more
core   +1 more source

Rainbow connection number of amalgamation of some graphs

, 2016
Let G be a nontrivial connected graph. For k∈N, we define a coloring c:E(G)→{1,2,…,k} of the edges of G such that adjacent edges can be colored the same. A path P in G is a rainbow path if no two edges of P are colored the same. A rainbow path connecting
D. Fitriani, A.N.M. Salman, Salman, A.N.M., Fitriani, D.   +3 more
core   +1 more source

Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph

, 2011
6 ...
Chen, Lily, Li, Xueliang, Liu, Mengmeng
openaire   +2 more sources

Relative timing information and orthology in evolutionary scenarios. [PDF]

Algorithms Mol Biol, 2023
Schaller D, Hartmann T, Lafond M, Stadler PF, Wieseke N, Hellmuth M.   +5 more
europepmc   +1 more source

Rainbow Connection Number Pada Operasi Graf

, 2014
An edge-colouring of a graph $G$ is rainbow connected if  there are $k$ internally vertex-disjoint paths joining them, with no two edges on the path have the same color.
Yulianti S, Arnasyitha, Dafik, Dafik
core