Results 51 to 60 of about 9,635,811 (355)

Game domination number

Discrete Mathematics, 2002
The dominating set of a digraph \(D\) is a set \(S\) of vertices such that for every \(v\not\in S\) there exists \(u\in S\) with \(uv\in A(D)\). The domination number of \(D\) is the cardinality of the smallest dominating set. The game domination number of an undirected graph \(G\) is the domination number of the digraph \(D\) obtained as a result of ...
Alon, Noga, Balogh, József, Bollobás, Béla, Szabó, Tamás   +3 more
openaire   +1 more source

Some sufficient conditions for a tree to have its weak Roman domination number be equal to its domination number plus 1

AIMS Mathematics, 2023
Let $ G = (V, E) $ be a simple graph with vertex set $ V $ and edge set $ E $, and let $ f $ be a function $ f:V\mapsto \{0, 1, 2\} $. A vertex $ u $ with $ f(u) = 0 $ is said to be undefended with respect to $ f $ if it is not adjacent to a vertex with ...
Jian Yang, Yuefen Chen, Zhiqiang Li
doaj   +1 more source

On resolving domination number of special family of graphs

Journal of Physics: Conference Series, 2020
Let G be a simple, finite, and connected graph. A dominating set D is a set of vertices such that each vertex of G is either in D or has at least one neighbor in D.
Y. Wangguway, Slamin, Dafik, D. Wardani, R. Alfarisi   +4 more
semanticscholar   +1 more source

Alternative Domination in Graphs

AKCE International Journal of Graphs and Combinatorics
Sometimes while you are using the Internet, for example, via a Wi-Fi network from one of the companies, the Internet is suddenly cut off due to a malfunction at that point, which disrupts your important work on the Internet, so there is a need for ...
Ali Mohammed Sahal
doaj   +1 more source

The 3-Rainbow Domination Number of the Cartesian Product of Cycles

Mathematics, 2020
We have studied the k-rainbow domination number of C n □ C m for k ≥ 4 (Gao et al. 2019), in which we present the 3-rainbow domination number of C n □ C m , which should be bounded above by the four-rainbow domination number of C n □ C m .
Hong Gao, Changqing Xi, Yuansheng Yang
semanticscholar   +1 more source

On the Outer Independent Double Roman Domination Number [PDF]

Bulletin of the Iranian Mathematical Society, 2019
An outer independent (double) Roman dominating function is a (double) Roman dominating function f for which the set of vertices assigned 0 under f is independent.
D. Mojdeh, B. Samadi, Z. Shao, I. G. Yero   +3 more
semanticscholar   +1 more source

On the domination search number

Discrete Applied Mathematics, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fomin, Fedor V., Kratsch, Dieter, Müller, Haiko   +2 more
openaire   +2 more sources

Graphs with Total Domination Number Double of the Matching Number

Journal of New Theory
A subset $S$ of vertices of a graph $G$ with no isolated vertex is called a total dominating set of $G$ if each vertex of $G$ has at least one neighbor in the set $S$.
Selim Bahadır
doaj   +1 more source

Odd and even repetition sequences of independent domination number

, 2020
Let {Pn}n=1 ∞ be a sequence of paths. The odd repetition sequence denoted by {ρk : k ∈ N} is a sequence of natural numbers in which odd numbers are repeated once and defined by {ρk } = {1, 1, 2, 3, 3, 4, 5, 5, ... } = {i(Pn)} where n = 2k − 1.
Leomarich F. Casinillo
semanticscholar   +1 more source

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, Floortje Strobbe, Annemarie A. Verrijn Stuart, Hanneke M. van Santen, Gerlof D. Valk, Sasja A. Schepers, Rachel S. van Leeuwaarde   +6 more
wiley   +1 more source