Results 131 to 140 of about 8,369 (289)

Independent Domination Of Subcubic Graphs [PDF]

open access: yes, 2016
Let G be a simple graph. The independent domination number i(G) is the minimum cardinality among all maximal independent sets of G. A graph is subcubic whenever the maximum degree is at most three.
Priddy, Bruce Allan
core   +1 more source

Γ-independent dominating graphs of paths and cycles [PDF]

open access: yesSongklanakarin Journal of Science and Technology (SJST)
A set D of vertices in a graph G is an independent dominating set if D is a set of pairwise nonadjacent vertices of G such that every vertex of G not in D is adjacent to at least one vertex in D.
Roongrat Samanmoo   +1 more
doaj  

Stimulator of interferon genes agonist augmented antitumor immunity of osimertinib in Egfr‐mutated lung cancer

open access: yesMolecular Oncology, EarlyView.
Combining osimertinib with the STING agonist ADU‐S100 activates innate and adaptive immunity to overcome the non‐inflamed microenvironment of Egfr‐mutant lung cancer. This combination increases NK and CD8+ T‐cell infiltration, associated with activation of the STING‐IRF3 pathway and local immunogenic cell death.
Jun Nishimura   +19 more
wiley   +1 more source

On the Independent Domination Number of Random Regular Graphs [PDF]

open access: yes, 2003
A dominating set D of a graph G is a subset of V (G) such that for every vertex v ∈ V (G), either in v ∈ D or there exists a vertex u ∈ D that is adjacent to v. We are interested in finding dominating sets of small cardinality.
W. Duckworth, N. C. Wormald
core  

USP29‐regulated noncanonical stabilization of the hypoxia‐inducible factor‐α in aggressive prostate cancer

open access: yesMolecular Oncology, EarlyView.
We identify USP29 as the only DUB mirroring CA9 expression, a marker of hypoxia and HIF pathway activation associated with PCA aggressiveness. USP29 stabilizes HIF‐1α and HIF‐2α via a noncanonical mechanism that is independent of PHD/pVHL activity yet relies on proteasomal regulation, establishing USP29 as a previously unrecognized regulator of hypoxic
Amelie S Schober   +16 more
wiley   +1 more source

Longitudinal genome‐wide aneuploidy measurements in circulating cell‐free DNA to predict lack of benefit from pembrolizumab in patients with metastatic urothelial cancer

open access: yesMolecular Oncology, EarlyView.
Many patients with urothelial cancer do not benefit from treatment with pembrolizumab, while at risk of severe side effects. Changes in the levels of circulating tumor DNA early during treatment, measured by a simple and affordable assay that can be easily implemented in the clinic, can be used as a prognostic tool to identify these patients.
Youssra Salhi   +14 more
wiley   +1 more source

Independent Domination in Some Wheel Related Graphs [PDF]

open access: yes, 2016
A set S of vertices in a graph G is called an independent dominating set if S is both independent and dominating. The independent domination number of G is the minimum cardinality of an independent dominating set in G .
Vaidya, S. K., Pandit, R. M.
core   +1 more source

Strongly i-Bicritical Graphs

open access: yesTheory and Applications of Graphs
A graph $G$ is \emph{strongly $i$-bicritical} if it has independent domination number $i(G) \geq 3$, and $i(G - \{x, y\}) = i(G) - 2$ whenever $x$ and $y$ are two non-adjacent vertices of $G$.
Michelle Edwards   +2 more
doaj   +1 more source

MITF maintains genome stability in nonmelanocyte lineages

open access: yesMolecular Oncology, EarlyView.
MITF is essential for melanocyte survival and acts as an oncogene in 10%–20% of melanomas. We show that MITF depletion causes genome instability in nonmelanocytic cells, leading to LATS2‐mediated P53 activation, cell cycle arrest, and apoptosis. This study highlights the role of MITF as a genome maintenance factor beyond the melanocyte lineage. Created
Drifa H. Gudmundsdottir   +13 more
wiley   +1 more source

Independent Bondage Number in Planar Graphs Under Girth Constraints

open access: yesMathematics
Given a finite, simple, connected graph G with at least one edge, the independent bondage number bi(G) of G is the minimum size of an edge set, such that its deletion results in a graph with a strictly larger independent domination number than that of G.
E. G. K. M. Gamlath   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy