Results 11 to 20 of about 9,063,667 (65)
Domination number, independent domination number and 2-independence number in trees [PDF]
For a graph $G$, let $\gamma(G)$ be the domination number, $i(G)$ be the independent domination number and $\beta_2(G)$ be the 2-independence number. In this paper, we prove that for any tree $T$ of order $n ≥ 2, 4\beta_2(T) − 3\gamma(T) ≥ 3i(T)$, and we
Sheikholeslami, Seyed Mahmoud +9 more
core +2 more sources
Steiner domination decomposition number of graphs [PDF]
In this paper, we introduce a new concept Steiner domination decomposition number of graphs. Let be a connected graph with Steiner domination numberA decomposition of is said to be a Steiner Domination Decomposition if Steiner domination ...
Mahiba, M, Ebin Raja Merly, E
core +1 more source
The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]
The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar +3 more
core +1 more source
A note on the k-domination number of a graph [PDF]
summary:Let $G=(V, E)$ be a simple graph. A subset $S\subseteq V$ is a dominating set of $G$, if for any vertex $u\in V-S$, there exists a vertex $v\in S$ such that $uv\in E$.
Liang Sun +11 more
core +3 more sources
Triple Connected Domination Number of a Graph [PDF]
The concept of triple connected graphs with real life application was introduced by considering the existence of a path containing any three vertices of a graph G.
Selvam Avadayappan +7 more
core +1 more source
Singed Total Domatic Number of a Graph [PDF]
The maximum number of functions in a signed total dominating family on G is the signed total domatic number of G. In this paper, some properties related signed total domatic number and signed total domination number of a graph are studied and found the ...
Shailaja S. Shirkol +2 more
core +1 more source
The Number of Minimum Dominating Sets in Pn × P2 [PDF]
A set S of vertices in a graph G is said to be a Smarandachely k-dominating set if each vertex of G is dominated by at least k vertices of S.
Kishori P. Narayankar +5 more
core +1 more source
Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem [PDF]
We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD +5 more
core +1 more source
Product throttling for power domination [PDF]
The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power throttling number.
Trenk, Ann +6 more
core
Inequalities involving independence domination, $f$-domination, connected and total $f$-domination numbers [PDF]
summary:Let $f$ be an integer-valued function defined on the vertex set $V(G)$ of a graph $G$. A subset $D$ of $V(G)$ is an $f$-dominating set if each vertex $x$ outside $D$ is adjacent to at least $f(x)$ vertices in $D$.
Wei, Bing +7 more
core +1 more source

