Topology-based sparsification of graph annotations. [PDF]
Danciu D +4 more
europepmc +1 more source
On the total rainbow connection of the wheel related graphs
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 +4 more
core
Structure of the siphophage neck-Tail complex suggests that conserved tail tip proteins facilitate receptor binding and tail assembly. [PDF]
Xiao H +8 more
europepmc +1 more source
Structures of pseudorabies virus capsids. [PDF]
Wang G +18 more
europepmc +1 more source
Gallai-Ramsey and vertex proper connection numbers
Given a complete graph G, we consider two separate scenarios. First, we consider the minimum number N such that every coloring of G using exactly k colors contains either a rainbow triangle or a monochromatic star on t vertices.
Emily C. Chizmar, Chizmar, Emily C
core
CONTINUITY: CONnectivity Tool with INtegration of sUbcortical regions, regIstration and visualization of TractographY. [PDF]
Piot E, Bagonis M, Prieto JC, Styner M.
europepmc +1 more source
Analysis on COVID-19 Infection Spread Rate during Relief Schemes Using Graph Theory and Deep Learning. [PDF]
Palanivinayagam A +5 more
europepmc +1 more source
Rainbow Connection Number of Special Graph and Its Operations
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
Structural basis for genome packaging, retention, and ejection in human cytomegalovirus. [PDF]
Li Z, Pang J, Dong L, Yu X.
europepmc +1 more source
Rainbow Connection Number of Prism and Product of Two Graphs
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

