Results 21 to 30 of about 14,286,036 (225)
Domination subdivision and domination multisubdivision numbers of graph [PDF]
, 2019 The domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T) ≤ 3 for any tree
Topp, Jerzy +5 more
core +1 more source
Molecular Oncology, EarlyView.This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source
Trees whose 2-domination subdivision number is 2 [PDF]
, 2012 A set \(S\) of vertices in a graph \(G = (V,E)\) is a \(2\)-dominating set if every vertex of \(V\setminus S\) is adjacent to at least two vertices of \(S\). The \(2\)-domination number of a graph \(G\), denoted by \(\gamma_2(G)\), is the minimum size of
M. Atapour +7 more
core +3 more sources
Molecular Oncology, EarlyView.Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur +11 more
wiley +1 more source
Characterization of double domination subdivision number of trees [PDF]
, 2007 In a graph G, a vertex dominates itself and its neighbors. A subset S⊆V(G) is a double dominating set of G if S dominates every vertex of G at least twice. The double domination number dd(G) is the minimum cardinality of a double dominating set of G. The
Khodkar, Abdollah +2 more
core +1 more source
FEBS Open Bio, EarlyView.We describe detailed protocols for the purification and preparation of Marchantia polymorpha Auxin Response Factor 2 (MpARF2). This protein is fused to an MBP solubility tag and an mNG fluorescent tag and is purified from Escherichia coli. The presented procedures make it possible to study MpARF2 assemblies, which could arise from phase separation ...
Bas Janssen +5 more
wiley +1 more source
Total Restrained Domination Subdivision Number for Cartesian Product Graph
International Journal of Mathematics and Soft Computing, 2013 In this paper we determine the total restrained dominating set and the total restrained domination subdivision number for Cartesian product graph.
G. Hemalatha, P. Jeyanthi
openaire +1 more source
Weakly connected domination subdivision numbers [PDF]
, 2008 A set D of vertices in a graph G = (V,E) is a weakly connected dominating set of G if D is dominating in G and the subgraph weakly induced by D is connected.
Raczek, Joanna
core +1 more source
SPG4 and Dementia: Expanding the Clinical Spectrum
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Hereditary spastic paraplegia (HSP) is a group of disorders characterized by progressive spasticity and lower limb weakness, with mutations in SPG4/SPAST being the most common cause. Detailed studies and clinical and molecular comparisons across different populations are missing.
Emanuele Panza +19 more
wiley +1 more source
Inequalities involving independence domination, $f$-domination, connected and total $f$-domination numbers [PDF]
, 1978 summary:Let $f$ be an integer-valued function defined on the vertex set $V(G)$ of a graph $G$. A subset $D$ of $V(G)$ is an $f$-dominating set if each vertex $x$ outside $D$ is adjacent to at least $f(x)$ vertices in $D$.
Allan, Robert B. +7 more
core +1 more source