Results 81 to 90 of about 313,249 (265)
Maximum Number of Minimum Dominating and Minimum Total Dominating Sets
Given a connected graph with domination (or total domination) number \gamma>=2, we ask for the maximum number m_\gamma and m_{\gamma,T} of dominating and total dominating sets of size \gamma.
Godbole, Anant +2 more
core
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
Bounds on the 2-domination number in cactus graphs [PDF]
A \(2\)-dominating set of a graph \(G\) is a set \(D\) of vertices of \(G\) such that every vertex not in \(S\) is dominated at least twice. The minimum cardinality of a \(2\)-dominating set of \(G\) is the \(2\)-domination number \(\gamma_{2}(G)\).
Mustapha Chellali
doaj
Total Roman Reinforcement in Graphs
A total Roman dominating function on a graph G is a labeling f : V (G) → {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2 and the subgraph of G induced by the set of all vertices of positive weight has no isolated vertex.
Ahangar H. Abdollahzadeh +4 more
doaj +1 more source
Maker-Breaker total domination number
The Maker-Breaker total domination number, $γ_{\rm MBT}(G)$, of a graph $G$ is introduced as the minimum number of moves of Dominator to win the Maker-Breaker total domination game, provided that he has a winning strategy and is the first to play. The Staller-start Maker-Breaker total domination number, $γ_{\rm MBT}'(G)$, is defined analogously for the
Divakaran, Athira +3 more
openaire +2 more sources
This study shows that copy number variations (CNVs) can be reliably detected in formalin‐fixed paraffin‐embedded (FFPE) solid cancer samples using ultra‐low‐pass whole‐genome sequencing, provided that key (pre)‐analytical parameters are optimized.
Hanne Goris +10 more
wiley +1 more source
Total Outer-Independent Domination Number: Bounds and Algorithms
In graph theory, the study of domination sets has garnered significant interest due to its applications in network design and analysis. Consider a graph G(V,E); a subset of its vertices is a total dominating set (TDS) if, for each x∈V(G), there exists an
Paul Bosch +3 more
doaj +1 more source
Single circulating tumor cells (sCTCs) from high‐grade serous ovarian cancer patients were enriched, imaged, and genomically profiled using WGA and NGS at different time points during treatment. sCTCs revealed enrichment of alterations in Chromosomes 2, 7, and 12 as well as persistent or emerging oncogenic CNAs, supporting sCTC identity.
Carolin Salmon +9 more
wiley +1 more source
Total domination and total domination subdivision number of a graph and its complement
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Favaron, O. +2 more
openaire +2 more sources
Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment
This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley +1 more source

