Results 111 to 120 of about 12,767 (290)
On the total domatic number of regular graphs [PDF]
Transactions on Combinatorics, 2012 A set S of vertices of a graph G = (V;E) without isolated vertex is a total dominating set if every vertex of V (G) is adjacent to some vertex in S.
H. Aram +2 more
doaj
Trees with large neighborhood total domination number
Discrete Applied Mathematics, 2015 In this paper, we continue the study of neighborhood total domination in graphs first studied by Arumugam and Sivagnanam [Opuscula Math. 31 (2011), 519--531]. A neighborhood total dominating set, abbreviated NTD-set, in a graph $G$ is a dominating set $S$ in $G$ with the property that the subgraph induced by the open neighborhood of the set $S$ has no ...
Michael A. Henning, Kirsti Wash
openaire +3 more sources
CCDC80 suppresses high‐grade serous ovarian cancer migration via negative regulation of B7‐H3
Molecular Oncology, EarlyView.PAX8 is a lineage‐specific master regulator of transcription in high‐grade serous ovarian cancer (HGSC) progression. We show for the first time that PAX8 facilitates proliferation and metastasis by repressing the cell autonomous tumor suppressor CCDC80 and inducing B7‐H3 expression.
Aya Saleh +12 more
wiley +1 more source
KDM7A and KDM1A inhibition suppresses tumour promoting pathways in prostate cancer
Molecular Oncology, EarlyView.Treatment resistance is a major challenge for patients with advanced prostate cancer. This study examined an alternative approach to target the major prostate cancer‐promoting pathway by targeting epigenetic factors, whose levels are higher in tumours.
Jennie N Jeyapalan +16 more
wiley +1 more source
Total domination dot-stable graphs
, 2011 A set S of vertices in a graph G is a total dominating set if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number of G.
Haynes, Teresa W. +3 more
core +1 more source
Lower bounds on the signed (total) $k$-domination number depending on the clique number
Communications in Combinatorics and Optimization, 2018 Let $G$ be a graph with vertex set $V(G)$. For any integer $k\ge 1$, a signed (total) $k$-dominating function is a function $f: V(G) \rightarrow \{ -1, 1\}$ satisfying $\sum_{x\in N[v]}f(x)\ge k$ ($\sum_{x\in N(v)}f(x)\ge k$) for every $v ...
L. Volkmann
doaj +1 more source
Molecular Oncology, EarlyView.EXOSC10, an essential nuclear RNA exosome‐associated 3′‐5′ exoribonuclease, is inhibited by the anticancer drug 5‐fluorouracil (5‐FU), and EXOSC10 depletion increases 5‐FU sensitivity. The colon‐cancer variant EXOSC10S402T, located in a proteolysis motif, is stable and nuclear but nonfunctional in vivo.
Radhika Sain +10 more
wiley +1 more source
Total Domination Cover Rubbling
, 2020 Let G be a connected simple graph with vertex set V and a distribution of pebbles on the vertices of V. The total domination cover rubbling number of G is the minimum number of pebbles, so that no matter how they are distributed, it is possible that ...
Haynes, Teresa W. +3 more
core +1 more source
Molecular Oncology, EarlyView.Here, we demonstrate that HS1BP3 interacts with Cortactin through a proline‐rich region (PRR3.1) and show that this interaction, and HS1BP3 itself, promote cancer cell proliferation and invasion. Inhibition of this interaction leads to build‐up of TKS5 in multivesicular endosomes and altered secretion of CD63 and CD9, providing an explanation for the ...
Arja Arnesen Løchen +9 more
wiley +1 more source
Bounds On The Disjunctive Total Domination Number Of A Tree
Discussiones Mathematicae Graph Theory, 2016 Let G be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, γt(G).
Henning Michael A., Naicker Viroshan
doaj +1 more source