Results 71 to 80 of about 7,428 (262)
Independent Dominator Sequence Number of a Graph
AbstractLet G = (V, E) be a connected graph. A dominator sequence in G is a sequence of vertices S = (v1, v2,. . ., vk) such that for each i with 2 ≤ i ≤ k, the vertex vi dominates at least one vertex which is not dominated by v1, v2,. . ., vi−1. If further the set of vertices in S is an independent set, then S is called an independent dominator ...
Arumugam, S. +2 more
openaire +1 more source
Clinical trials on PARP inhibitors in urothelial carcinoma (UC) showed limited efficacy and a lack of predictive biomarkers. We propose SLFN5, SLFN11, and OAS1 as UC‐specific response predictors. We suggest Talazoparib as the better PARP inhibitor for UC than Olaparib.
Jutta Schmitz +15 more
wiley +1 more source
HDAC4 is degraded by the E3 ligase FBXW7. In colorectal cancer, FBXW7 mutations prevent HDAC4 degradation, leading to oxaliplatin resistance. Forced degradation of HDAC4 using a PROTAC compound restores drug sensitivity by resetting the super‐enhancer landscape, reprogramming the epigenetic state of FBXW7‐mutated cells to resemble oxaliplatin ...
Vanessa Tolotto +13 more
wiley +1 more source
Strong Domination Index in Fuzzy Graphs
In this article, a novel idea of domination degree and index are defined in a fuzzy graph (FG) using weight of strong edges. The strong domination degree (SDD) of a vertex u is defined using the weight of minimal strong dominating set (MSDS) containing u.
Kavya R. Nair +1 more
doaj +1 more source
Graphs with equal domination and independent domination number
A set S of vertices of a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. The independent domination number of G, denoted by i(G), is the minimum cardinality of an independent dominating set of G.
VAİDYA, S. K., PANDİT, R. M.
openaire +2 more sources
The ratio of domination and independent domination numbers on trees
Let $ (G)$ and $i(G)$ be the domination number and the independent domination number of $G$, respectively. In 1977, Hedetniemi and Mitchell began with the comparison of of $i(G)$ and $ (G)$ and recently Rad and Volkmann posted a conjecture that $i(G)/ (G) \leq (G)/2$, where $ (G)$ is the maximum degree of $G$.
Wang, Shaohui, Wei, Bing
openaire +3 more sources
Domination and independence subdivision numbers of graphs
A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating in \(G\), if each vertex of \(G\) either is in \(S\), or is adjacent to a vertex of \(S\). A set \(S\subseteq V(G)\) is independent in \(G\), if no two vertices of \(S\) are adjacent in \(G\).
Haynes, Teresa W. +2 more
openaire +2 more sources
Liquid biopsy enables minimally invasive, real‐time molecular profiling through analysis of circulating biomarkers in biological fluids. This Perspective highlights the importance of training pathologists through integrative educational programs, such as the European Masters in Molecular Pathology, to ensure effective and equitable implementation of ...
Marius Ilié +13 more
wiley +1 more source
Extremal connected graphs for independent domination number
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brigham, Robert C. +2 more
openaire +3 more sources
Monitoring circulating tumor DNA (ctDNA) in patients with operable breast cancer can reveal disease relapse earlier than radiology in a subset of patients. The failure to detect ctDNA in some patients with recurrent disease suggests that ctDNA could serve as a supplement to other monitoring approaches.
Kristin Løge Aanestad +35 more
wiley +1 more source

