Results 91 to 100 of about 12,767 (290)
The Moore graphs; total domination and total dominator chromatic numbers
FilomatA total dominator coloring of a graph G is a proper coloring of G in which each vertex of the graph is adjacent to all vertices of a color class. The minimum number of color classes in a total dominator coloring of a graph is called its total dominator chromatic number.
Maliheh Alaei, Adel Kazemi
openaire +1 more source
Perfectly relating the domination, total domination, and paired domination numbers of a graph
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
José D. Alvarado +2 more
openaire +2 more sources
The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers
Molecular Oncology, EarlyView.The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce +11 more
wiley +1 more source
Lower bounds for the domination number and the total domination number of direct product graphs
, 2010 A sharp lower bound for the domination number and the total domination number of the direct product of finitely many complete graphs is given: γ(×i=1tKni)≥t+1,t≥3.
Gašper Mekiš, Mekiš, Gašper
core +1 more source
Bounds on the 2-domination number in cactus graphs [PDF]
Opuscula Mathematica, 2006 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
Discussiones Mathematicae Graph Theory, 2019 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
Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment
Molecular Oncology, EarlyView.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
Total Outer-Independent Domination Number: Bounds and Algorithms
AlgorithmsIn 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
On the total k-domination number of graphs
Discussiones Mathematicae Graph Theory, 2012 Let k be a positive integer and let G = (V,E) be a simple graph. The k-tuple domination number γ×k(G) of G is the minimum cardinality of a k-tuple dominating set S, a set that for every vertex v ∈ V , |NG[v]∩S| ≥ k. Also the total k-domination number γ×k,t(G) of G is the minimum cardinality of a total k -dominating set S, a set that for every vertex v ∈
openaire +1 more source
Molecular Oncology, EarlyView.Dimethyl fumarate (DMF) reduces growth of HPV‐positive cervical cancer spheroids and induces ferroptosis in cervical cancer cells via blocking SLC7A11/Glutathione (GSH) axis. Combination of subcytotoxic doses of DMF and cisplatin (CDDP) further suppresses spheroid growth and drives cell death in 2D culture models.
Carolina Punziano +6 more
wiley +1 more source