Results 81 to 90 of about 650 (167)

Rainbow Connection Number of Special Graph and Its Operations

, 2014
Let $G$ be a simple graph. An edge-coloring of a graph $G$ is rainbow connected if, for any two vertices of $G$, there are $k$ internally vertex-disjoint paths joining them, each of which is rainbow and then a minimal numbers of color $G$ is required to ...
Nastiti, Artanty, Dafik, Dafik
core  

Rainbow Connection Number of Prism and Product of Two Graphs

, 2014
An edge-colouring of a graph $G$ is rainbow connected if, for any two vertices of $G$, there are $k$ internally vertex-disjoint paths joining them, each of which is rainbow and then a minimal numbers of color $G$ is required to make rainbow connected ...
Darmawan, Randhi N., Dafik, Dafik
core  

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 K-Connection In Dense Graphs

, 2011
An edge-colouring of a graph G is rainbow k-connected if, for any two vertices of G , there are k internally vertex-disjoint paths joining them, each of which is rainbow (i.e., all edges of each path have distinct colours).
Liu, Henry, Shinya Fujita, Fujita, Shinya, Henry Liu, Colton Magnant, Magnant, Colton   +5 more
core   +1 more source

On rainbow vertex antimagic coloring and its application to the encryption keystream construction [PDF]

Let G = (V,E) be a graph that is a simple, connected and un-directed graph. We now introduce a new notion of rainbow vertex antimagic coloring. This is a proper development of antimagic labeling with rainbow vertex coloring.
Nagaraja, Vaishnavi, Nisviasari, Rosanita, Kurniawati, Elsa Yuli, Husain, Sharifah Kartini Said, Baihaki, Rifki Ilham, Agustin, Ika Hesti, Dafik, Dafik   +6 more
core   +1 more source

Topology-based sparsification of graph annotations. [PDF]

Bioinformatics, 2021
Danciu D, Karasikov M, Mustafa H, Kahles A, Rätsch G.   +4 more
europepmc   +1 more source

ANALISIS RAINBOW CONNECTION NUMBER PADA GRAF KHUSUS DAN HASIL OPERASINYA [PDF]

, 2015
Misalkan G adalah graf terhubung nontrivial dengan edge ¡ coloring c : E(G) ! f1; 2; 3; :::; kg dengan k 2 N, dan mungkin terdapat pewarnaan sisi yang sama pada dua sisi yang bertetangga. Suatu lintasan u ¡ v di G merupakan rainbow path jika tidak ada
Darmawan, Randhi Nanang
core  

Structure of the siphophage neck-Tail complex suggests that conserved tail tip proteins facilitate receptor binding and tail assembly. [PDF]

PLoS Biol, 2023
Xiao H, Tan L, Tan Z, Zhang Y, Chen W, Li X, Song J, Cheng L, Liu H.   +8 more
europepmc   +1 more source

On the total rainbow connection of the wheel related graphs

, 2018
IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018)Let G = (V (G); E(G)) be a nontrivial connected graph with an edge coloring c : E(G) ! f1; 2; :::; lg; l 2 N, with the condition that the adjacent edges may be colored by the same colors.
Alfarisi, Ridho, M.S Hasan, Slamin, Slamin, Agustin, Ika Hesti, Dafik, Dafik   +4 more
core  

CONTINUITY: CONnectivity Tool with INtegration of sUbcortical regions, regIstration and visualization of TractographY. [PDF]

Proc SPIE Int Soc Opt Eng, 2022
Piot E, Bagonis M, Prieto JC, Styner M.
europepmc   +1 more source