Results 91 to 100 of about 232,724 (277)
FEBS Open Bio, EarlyView.KLK7, a tissue kallikrein‐related peptidase, is elevated in advanced colorectal cancer and associated with shorter survival. High KLK7 levels in ascites correlate with peritoneal metastasis. In mice, KLK7 overexpression increases metastasis. In vitro, KLK7 enhances cancer cell proliferation, migration, adhesion, and spheroid formation, driving ...
Yosr Z. Haffani +6 more
wiley +1 more source
Edge Roman domination on graphs
, 2014 An edge Roman dominating function of a graph $G$ is a function $f\colon E(G) \rightarrow \{0,1,2\}$ satisfying the condition that every edge $e$ with $f(e)=0$ is adjacent to some edge $e'$ with $f(e')=2$.
Chang, Gerard J. +2 more
core
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
Graphs and CombinatoricsAbstractLet G be a bridgeless graph. An orientation of G is a digraph obtained from G by assigning a direction to each edge. The oriented diameter of G is the minimum diameter among all strong orientations of G. The connected domination number $$\gamma _c(G)$$ γ c
Peter Dankelmann +2 more
openaire +2 more sources
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
Connected-domination triangle graphs and connected neighbourhood numbers
, 2016 Дискретная математика и математическая ...
Kartynnik, Y. A., Orlovich, Y. L.
openaire +1 more source
Triple Connected Domination Number Of A Graph
, 2018 {"references": ["1.\tMahadevan G, Selvam A, Paulraj Joseph J, Ayisha B and Subramanian T, Complementary triple connected domination number of a graph, accepted for publication in Advances and Applications inDiscrete Mathematics, ISSN0974-1658(2012). 2.\tMahadevan. G, Selvam Avadayappan, Nagarajan. A, Rajeswari. A, Subramanian.
V. Murugan, N. Rajkumari
openaire +1 more source
On domination critical graphs with cutvertices having connected domination number 3 [PDF]
International Mathematical Forum, 2007 A subset of vertices D of a graph G is a dominating set for G if every vertex of G not in D is adjacent to one in D. A dominating set for G is a connected dominating set if it induces a connected subgraph of G. The connected domination number of G, denoted by γc(G), is the minimum cardinality of a connected dominating set.
openaire +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
Three domination number and connectivity in graphs
, 2015 In a graph G, a vertex dominates itself and its neighbors. A subset S of V is called a dominating set in G if every vertex in V is dominated by at least one vertex in S. The domination number gamma G is the minimum cardinality of a dominating set. A set S subset V is called a double dominating set of a graph G if every vertex in V is dominated by at ...
Mehry, S., Safakish, R.
openaire +2 more sources