Results 91 to 100 of about 5,986,669 (282)
Connected minimum secure-dominating sets in grids
AKCE International Journal of Graphs and Combinatorics, 2017 For any (finite simple) graph the secure domination number of satisfies . Here we find a secure-dominating set in such that in all cases when is a grid, and in the majority of cases when is a cylindrical or toroidal grid. In all such cases, satisfies the additional requirement that is connected.
Johnathan Barnett +5 more
openaire +2 more sources
Disjoint Secure Domination in the Join of Graphs
Recoletos Multidisciplinary Research Journal, 2016 Let G = (V(G),E(G)) be a simple connected graph. A dominating set S in G is called a secure dominating set in G if for every u ∈ V (G) \ S, there exists v ∈ S ∩ NG(u) such that (S \ {v}) ∪ {u} is a dominating set.
Jonecis Dayap, Enrico Enriquez
doaj +1 more source
Translating whole‐genome doubling into precision medicine in cancer
Molecular Oncology, EarlyView.Whole‐genome doubling creates a WGD‐positive tumor state characterized by persistent chromosomal instability, karyotypic diversification, and cellular stress. These same biological pressures drive aggressive tumor evolution while exposing therapeutic vulnerabilities, providing a rationale for WGD‐informed precision medicine. Whole‐genome doubling (WGD)
Sejung Lee, Junghyeok Lim, Jinhyuk Bhin
wiley +1 more source
The Minimum Connected Dominating Set Problem (MCDSP).
, 2017 The Minimum Connected Dominating Set Problem (MCDSP)
ZERAOUI, Nacira
core
Disjoint Connected Dominating Sets in Pseudorandom Graphs
Proceedings of the 57th Annual ACM Symposium on Theory of Computing10 ...
Nemanja Draganic, Michael Krivelevich
openaire +3 more sources
Domination Parameters of a Graph and its Complement
Discussiones Mathematicae Graph Theory, 2018 A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G.
Desormeaux Wyatt J. +2 more
doaj +1 more source
Molecular Oncology, EarlyView.This review summarizes the transcription factors, repressive chromatin‐modifying complexes, and epigenetic mechanisms that control fetal hemoglobin repression. Notably, many regulators of γ‐globin silencing also function in transcriptional and epigenetic networks that drive cancer, highlighting opportunities to translate advances in hemoglobinopathy ...
Meigen Yu +3 more
wiley +1 more source
, 2015 Info lebih lanjut hub: Lembaga Penelitian Universitas Jember Jl. Kalimantan No.37 Telp. 0331-339385 Fax. 0331-337818 JemberSaat ini Jaringan komputer berkembang dengan sangat cepat. Pada jaringan komputer juga dipasang jaringan intranet. produktivitas.
Ika HestiAgustin
core
Lossy Kernels for Connected Dominating Set on Sparse Graphs [PDF]
, 2018 For alpha > 1, an alpha-approximate (bi-)kernel for a problem Q is a polynomial-time algorithm that takes as input an instance (I, k) of Q and outputs an instance (I',k') (of a problem Q') of size bounded by a function of k such that, for every c >= 1, a
Mouawad, Amer E. +4 more
core +1 more source
dib-lab/2022-dominating-set-differential-abundance-example: preprint version 1.0
, 2022 A reproducible example demonstrating an example workflow for performing dominating set differential abundance ...
Taylor Reiter
core +1 more source