Results 111 to 120 of about 7,398 (287)
Total Domination Multisubdivision Number of a Graph
Discussiones Mathematicae Graph Theory, 2015 The domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G.
Avella-Alaminos Diana +3 more
doaj +1 more source
Domination criticality in product graphs
AKCE International Journal of Graphs and Combinatorics, 2015 A connected dominating set is an important notion and has many applications in routing and management of networks. Graph products have turned out to be a good model of interconnection networks. This motivated us to study the Cartesian product of graphs G
M.R. Chithra, A. Vijayakumar
doaj +1 more source
Connected Domination Critical Graphs [PDF]
, 2015 This thesis investigates the structure of connected domination critical graphs. The characterizations developed provide an important theoretical framework for addressing a number of difficult computational problems in the areas of operations research ...
Kaemawichanurat, Pawaton
core
Molecular Oncology, EarlyView.Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim +3 more
wiley +1 more source
Applicable Analysis and Discrete Mathematics, 2019 In this paper we introduce a domination game based on the notion of connected domination. Let G = (V,E) be a connected graph of order at least 2. We define a connected domination game on G as follows: The game is played by two players, Dominator and Staller. The players alternate taking turns choosing a vertex of G (Dominator starts).
Borowiecki, Mieczyslaw +2 more
openaire +2 more sources
FEBS Open Bio, EarlyView.Enzymes of the 2‐hydroxyacyl‐CoA lyase group catalyze the condensation of formyl‐CoA with aldehydes or ketones. Thus, by structural adaptation of active sites, practically any pharmaceutically and industrially important 2‐hydroxyacid could be biotechnologically synthesized. Combining crystal structure analysis, active site mutations and kinetic assays,
Michael Zahn +4 more
wiley +1 more source
When the connected domination number is at most the total domination number [PDF]
, 2011 In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number.
Schaudt, Oliver
core
PARP inhibitors induce a senescence phenotype in non‐small cell lung carcinoma cell lines
FEBS Open Bio, EarlyView.Talazoparib is the most potent inducer of senescence among different PARP1 inhibitors in human NSCLC cells. In the absence of PARP, no senescence phenotype was observed, demonstrating that PARP1 is necessary for the induction of senescence by this inhibitor.
Camille Huart +7 more
wiley +1 more source
FEBS Open Bio, EarlyView.Erythropoietin administration suppresses hepatic soluble epoxide hydrolase (sEH) expression, leading to increased CYP‐derived epoxides. This is associated with a shift in hepatic macrophage polarization characterized by reduced M1 markers and increased M2 markers, along with reduced hepatic inflammation, suppressed hepatic lipogenesis, and attenuated ...
Takeshi Goda +12 more
wiley +1 more source
Generalization of the total outer-connected domination in graphs [PDF]
, 2016 Let G = (V,E) be a graph without an isolated vertex. A set S ⊆ V is a total dominating set if S is a dominating set, and the induced subgraph G [ S ] does not contain an isolated vertex.
Rad, Nader Jafari +3 more
core +1 more source