Results 41 to 50 of about 368,338 (322)
Some notes on the isolate domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2017 A subset of vertices of a graph is a dominating set of if every vertex in has a neighbor in . The domination number is the minimum cardinality of a dominating set of . A dominating set is an isolate dominating set if the induced subgraph has at least one
Nader Jafari Rad
doaj +1 more source
On a conjecture concerning total domination subdivision number in graphs
AKCE International Journal of Graphs and Combinatorics, 2021 Let be the total domination number and let be the total domination subdivision number of a graph G with no isolated vertex. In this paper, we show that for some classes of graphs G, which partially solve the conjecture presented by Favaron et al.
S. Kosari +5 more
doaj +1 more source
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
Total 2-Rainbow Domination in Graphs
Mathematics, 2022 A total k-rainbow dominating function on a graph G=(V,E) is a function f:V(G)→2{1,2,…,k} such that (i) ∪u∈N(v)f(u)={1,2,…,k} for every vertex v with f(v)=∅, (ii) ∪u∈N(v)f(u)≠∅ for f(v)≠∅.
Huiqin Jiang, Yongsheng Rao
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
Graphs with Large Disjunctive Total Domination Number
, 2014 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, $\gamma_t(G)$.
Henning, Michael A., Naicker, Viroshan
core +2 more sources
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
Psychosocial Outcomes in Patients With Endocrine Tumor Syndromes: A Systematic Review
Pediatric Blood &Cancer, EarlyView.ABSTRACT Introduction The combination of disease manifestations, the familial burden, and varying penetrance of endocrine tumor syndromes (ETSs) is unique. This review aimed to portray and summarize available data on psychosocial outcomes in patients with ETSs and explore gaps and opportunities for future research and care.
Daniël Zwerus +6 more
wiley +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