Results 71 to 80 of about 14,864 (300)

Disjoint Secure Domination in the Join of Graphs

open access: yesRecoletos Multidisciplinary Research Journal, 2016
Let G = (V(G),E(G)) be a simple connected graph. A dominating set S in G is called a secure dominating set in G if for every u ∈ V (G) \ S, there exists v ∈ S ∩ NG(u) such that (S \ {v}) ∪ {u} is a dominating set.
Jonecis Dayap, Enrico Enriquez
doaj   +1 more source

NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set [PDF]

open access: gold, 2020
Bohan Li   +5 more
openalex   +1 more source

Relative Complement Set Based For Connected Dominating Set Algorithm For the Ad Hoc Network [PDF]

open access: green, 2021
Mao‐Lun Chiang   +4 more
openalex   +1 more source

Strength through diversity: how cancers thrive when clones cooperate

open access: yesMolecular Oncology, EarlyView.
Intratumor heterogeneity can offer direct benefits to the tumor through cooperation between different clones. In this review, Kuiken et al. discuss existing evidence for clonal cooperativity to identify overarching principles, and highlight how novel technological developments could address remaining open questions.
Marije C. Kuiken   +3 more
wiley   +1 more source

Domination Parameters of a Graph and its Complement

open access: yesDiscussiones Mathematicae Graph Theory, 2018
A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G.
Desormeaux Wyatt J.   +2 more
doaj   +1 more source

Characterization of Upper Detour Monophonic Domination Number

open access: yesCubo, 2020
This paper introduces the concept of \textit{upper detour monophonic domination number} of a graph. For a connected graph $G$ with vertex set $V(G)$, a set $M\subseteq V(G)$ is called minimal detour monophonic dominating set, if no proper subset of $M ...
M. Mohammed Abdul Khayyoom
doaj   +1 more source

Developing evidence‐based, cost‐effective P4 cancer medicine for driving innovation in prevention, therapeutics, patient care and reducing healthcare inequalities

open access: yesMolecular Oncology, EarlyView.
The cancer problem is increasing globally with projections up to the year 2050 showing unfavourable outcomes in terms of incidence and cancer‐related deaths. The main challenges are prevention, improved therapeutics resulting in increased cure rates and enhanced health‐related quality of life.
Ulrik Ringborg   +43 more
wiley   +1 more source

Infrared laser sampling of low volumes combined with shotgun lipidomics reveals lipid markers in palatine tonsil carcinoma

open access: yesMolecular 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

Connected Partitions via Connected Dominating Sets

open access: yes
The classical theorem due to Győri and Lovász states that any $k$-connected graph $G$ admits a partition into $k$ connected subgraphs, where each subgraph has a prescribed size and contains a prescribed vertex, as long as the total size of target subgraphs is equal to the size of $G$.
Niklanovits, Aikaterini   +3 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy