Results 41 to 50 of about 369,294 (274)
Total Roman Domination Number of Rooted Product Graphs
Mathematics, 2020 Let G be a graph with no isolated vertex and f:V(G)→{0,1,2} a function. If f satisfies that every vertex in the set {v∈V(G):f(v)=0} is adjacent to at least one vertex in the set {v∈V(G):f(v)=2}, and if the subgraph induced by the set {v∈V(G):f(v)≥1} has ...
Abel Cabrera Martínez +3 more
doaj +1 more source
Minus total domination in graphs [PDF]
Czechoslovak Mathematical Journal, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xing, Hua-Ming, Liu, Hai-Long
openaire +2 more sources
Lower Bounds for the Total Distance $k$-Domination Number of a Graph
Theory and Applications of GraphsFor $k \geq 1$ and a graph $G$ without isolated vertices, a \emph{total distance $k$-dominating set} of $G$ is a set of vertices $S \subseteq V(G)$ such that every vertex in $G$ is within distance $k$ to some vertex of $S$ other than itself.
Randy R. Davila
doaj +1 more source
Total restrained reinforcement in graphs
AKCE International Journal of Graphs and Combinatorics, 2016 In this paper we initiate the study of total restrained reinforcement in graphs. The total restrained reinforcement number in a graph G with no isolated vertex, is the minimum number of edges that have to be added to G so that the resulting graph has ...
Nader Jafari Rad, Lutz Volkmann
doaj +1 more source
Game total domination critical graphs [PDF]
Discrete Applied Mathematics, 2018 In the total domination game played on a graph $G$, players Dominator and Staller alternately select vertices of $G$, as long as possible, such that each vertex chosen increases the number of vertices totally dominated. Dominator (Staller) wishes to minimize (maximize) the number of vertices selected. The game total domination number, $ _{\rm tg}(G)$,
Henning, Michael A. +2 more
openaire +2 more sources
Clinical Insights Into Hypercalcemia of Malignancy in Childhood
Pediatric Blood &Cancer, EarlyView.ABSTRACT Hypercalcemia of malignancy (HCM) is a rare but life‐threatening metabolic emergency in children that occurs in less than 1% of pediatric cancer cases, with a reported incidence ranging from 0.4% to 1.0% across different studies. While it is observed in 10%–20% of adult malignancies, pediatric HCM remains relatively uncommon.
Hüseyin Anıl Korkmaz
wiley +1 more source
Bounds On The Disjunctive Total Domination Number Of A Tree
Discussiones Mathematicae Graph Theory, 2016 Let G be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, γt(G).
Henning Michael A., Naicker Viroshan
doaj +1 more source
On a Class of Graphs with Large Total Domination Number
, 2018 Let $\gamma(G)$ and $\gamma_t(G)$ denote the domination number and the total domination number, respectively, of a graph $G$ with no isolated vertices. It is well-known that $\gamma_t(G) \leq 2\gamma(G)$.
Bahadır, Selim, Gözüpek, Didem
core +1 more source
Total domination and vertex-edge domination in trees [PDF]
Proyecciones (Antofagasta), 2019 A vertex v of a graph G = (V,E) is said to ve-dominate every edge incident to v, as well as every edge adjacent to these incident edges. A set S ⊆ V is a vertex-edge dominating set if every edge of E is ve-dominated by at least one vertex of S. The minimum cardinality of a vertex-edge dominating set of G is the vertex-edge domination number γve(G) . In
Venkatakrishnan Y. B. +2 more
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Arteriovenous malformations (AVMs) are rare, high‐flow, vascular anomalies that can occur either sporadically or as part of a genetic syndrome. AVMs can progress with serious morbidity and even mortality if left unchecked. Sirolimus is an mTOR inhibitor that is effective in low‐flow vascular malformations; however, its role in AVMs is unclear.
Will Swansson +3 more
wiley +1 more source