Results 81 to 90 of about 7,428 (262)
On equality in an upper bound for the acyclic domination number [PDF]
Opuscula Mathematica, 2008 A subset \(A\) of vertices in a graph \(G\) is acyclic if the subgraph it induces contains no cycles. The acyclic domination number \(\gamma_a(G)\) of a graph \(G\) is the minimum cardinality of an acyclic dominating set of \(G\).
Vladimir Samodivkin
doaj
Molecular Oncology, EarlyView.The LINC01116 long noncoding RNA is induced by hypoxia and associated with poor prognosis and high recurrence rates in two cohorts of lung adenocarcinoma patients. Here, we demonstrate that besides its expression in cancer cells, LINC01116 is markedly expressed in lymphatic endothelial cells of the tumor stroma in which it participates in hypoxia ...
Marine Gautier‐Isola +12 more
wiley +1 more source
New bound on MIS and MIN-CDS for a unit ball graph
ICT Express, 2017 The size of the maximum independent set (MIS) in a graph G is called the independence number. The size of the minimum connected dominating set (MIN-CDS) in G is called the connected domination number.
D.A. Mojdeh, M. Ghanbari, M. Ramezani
doaj +1 more source
Independent domination bondage number in graphs
A non-empty set $S\subseteq V (G)$ of the simple graph $G=(V(G),E(G))$ is an independent dominating set of $G$ if every vertex not in $S$ is adjacent with some vertex in $S$ and the vertices of $S$ are pairwise non-adjacent. The independent domination number of $G$, denoted by $γ_i(G)$, is the minimum size of all independent dominating sets of $G$. The
Mehraban, M., Alikhani, S.
openaire +2 more sources
A subset of MMR‐proficient colon cancers responds to neoadjuvant immunotherapy
Molecular Oncology, EarlyView.Tan et al. reveal that a distinct subset of early‐stage pMMR colon cancers can respond to neoadjuvant immunotherapy. In the NICHE‐2 trial, responders (26%) were characterized by chromosomal instability, TP53 mutations, and proliferative cell‐cycle programs, whereas nonresponders showed metabolic and stromal reprogramming with TGF‐β‐driven ...
Eleonora Piumatti +3 more
wiley +1 more source
THE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES [PDF]
Communications of the Korean Mathematical Society, 2003 Summary: We count the numbers of independent dominating sets of rooted labeled trees, ordinary labeled trees, and recursive trees, respectively.
openaire +2 more sources
LDAcoop: Integrating non‐linear population dynamics into the analysis of clonogenic growth in vitro
Molecular Oncology, EarlyView.Limiting dilution assays (LDAs) quantify clonogenic growth by seeding serial dilutions of cells and scoring wells for colony formation. The fraction of negative wells is plotted against cells seeded and analyzed using the non‐linear modeling of LDAcoop.
Nikko Brix +13 more
wiley +1 more source
Molecular Oncology, EarlyView.Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff +11 more
wiley +1 more source
On Partition Dimension and Domination of Abid-Waheed 〖(AW)〗_r^4 Graph
مجلة بغداد للعلومA graph denoted by H, which has a simple link between its vertices, possesses the set of vertices V(H) . Given a graph, a set that is dominant, is a subset of vertex set such that any vertex outside of is close to at least one vertex inside of .
Jalal Hatem Hussein Bayati +3 more
doaj +1 more source
Independent transversal domination number of a graph
, 2017 Let $G=(V, E)$ be a graph. A set $S\subseteq V(G)$ is a {\it dominating set} of $G$ if every vertex in $V\setminus S$ is adjacent to a vertex of $S$. The {\it domination number} of $G$, denoted by $ (G)$, is the cardinality of a minimum dominating set of $G$.
Wang, Hongting +2 more
openaire +2 more sources