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
Rainbow K-Connection in Dense Graphs
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 +2 more
core
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
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 vertex-connection number of 3-connected graph
Zhiping Wang, Yixiao Liu, Xiaojing Xu
openaire +1 more source
The energy-spectrum of bicompatible sequences. [PDF]
Huang FW, Barrett CL, Reidys CM.
europepmc +1 more source
Distinct platelet F-actin patterns and traction forces on von Willebrand factor versus fibrinogen. [PDF]
Mollica MY +10 more
europepmc +1 more source
Refined Capsid Structure of Human Adenovirus D26 at 3.4 Å Resolution. [PDF]
Reddy VS, Yu X, Barry MA.
europepmc +1 more source
Entanglement bounds on the performance of quantum computing architectures. [PDF]
Eldredge Z +6 more
europepmc +1 more source
Review of computer-generated hologram algorithms for color dynamic holographic three-dimensional display. [PDF]
Pi D, Liu J, Wang Y.
europepmc +1 more source

