Results 61 to 70 of about 252,155 (281)
Connected domination in plane triangulations
Comment: 12 pages, 10 figures, 1 ...
Bryant, Felicity, Pavelescu, Elena
openaire +3 more sources
ERRFI1, a neural crest (NC)‐associated gene, was upregulated in melanoma and negatively correlated with the expression of melanocytic differentiation markers and the susceptibility of melanoma cells toward BRAF inhibitors (BRAFi). Knocking down ERRFI1 significantly increased the sensitivity of melanoma cells to BRAFi.
Nina Wang +8 more
wiley +1 more source
Domination Numbers of Amalgamations of Cycles at Connected Subgraphs
A set S of vertices of a graph G is a dominating set of G if every vertex in VG is adjacent to some vertex in S. A minimum dominating set in a graph G is a dominating set of minimum cardinality.
Prakassawat Boonmee +2 more
doaj +1 more source
3-Factor-criticality in double domination edge critical graphs [PDF]
A vertex subset $S$ of a graph $G$ is a double dominating set of $G$ if $|N[v]\cap S|\geq 2$ for each vertex $v$ of $G$, where $N[v]$ is the set of the vertex $v$ and vertices adjacent to $v$.
Shan, Erfang +2 more
core
On Minimum Maximal Distance-k Matchings
We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge analogue of $k$
Kartynnik, Yury, Ryzhikov, Andrew
core +1 more source
Some results on the independence number of connected domination critical graphs
A --critical graph is a graph with connected domination number and for any pair of non-adjacent vertices and of . Let and be respectively the clique number and the independence number of a graph.
P. Kaemawichanurat, T. Jiarasuksakun
doaj +2 more sources
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
The complexity of connected domination and total domination by restricted induced graphs [PDF]
Given a graph class C, it is natural to ask whether a given graph has a connected or a total dominating set inducing a graph of C and, if so, what is the minimal size of such a set.
Schaudt, Oliver, Schrader, Rainer
core
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
Generalized connected domination in graphs
As a generalization of connected domination in a graph G we consider domination by sets having at most k components. The order γ c k (G) of such a smallest set we relate to γ c (G), the order of a smallest connected dominating set. For a tree
M. Kouider, P.D. Vestergaard
doaj

