Results 71 to 80 of about 7,406 (155)

Topology-based sparsification of graph annotations. [PDF]

open access: yesBioinformatics, 2021
Danciu D   +4 more
europepmc   +1 more source

On the total rainbow connection of the wheel related graphs

open access: yes, 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   +4 more
core  

Structures of pseudorabies virus capsids. [PDF]

open access: yesNat Commun, 2022
Wang G   +18 more
europepmc   +1 more source

Gallai-Ramsey and vertex proper connection numbers

open access: yes, 2015
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  

Analysis on COVID-19 Infection Spread Rate during Relief Schemes Using Graph Theory and Deep Learning. [PDF]

open access: yesComput Math Methods Med, 2022
Palanivinayagam A   +5 more
europepmc   +1 more source

Rainbow Connection Number of Special Graph and Its Operations

open access: yes, 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

open access: yes, 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  

Home - About - Disclaimer - Privacy