Results 21 to 30 of about 8,714,403 (56)

Weak and Strong Reinforcement Number For a Graph [PDF]

open access: yes, 2010
Introducing the weak reinforcement number which is the minimum number of added edges to reduce the weak dominating number, and giving some boundary of this new parameter and ...
DOGAN, Derya   +2 more
core   +1 more source

Upper bounds for α-domination parameters [PDF]

open access: yes, 2009
We provide a new upper bound for the α-domination number in terms of a parameter α, 0 < α ≤ 1, and graph vertex degrees. This result generalises the well-known Caro-Roditty bound for the domination number of a graph.
Zverovich, Vadim   +2 more
core   +1 more source

Min-Max Dom-Saturation Number of a Tree [PDF]

open access: yes, 2010
In this paper we present a dynamic programming algorithm for determining the min-max domsaturation number of a ...
Sudha, S., Arumugam, S.
core   +1 more source

Inequalities involving independence domination, $f$-domination, connected and total $f$-domination numbers [PDF]

open access: yes, 1978
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$.
Allan, Robert B.   +7 more
core   +1 more source

On $f$-domination number of a graph [PDF]

open access: yes, 1990
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   +10 more
core   +1 more source

Product throttling for power domination [PDF]

open access: yes, 2020
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  

Game domination number [PDF]

open access: yes, 2002
The game domination number of a (simple, undirected) graph is defined by the following game. Two players, A and D, orient the edges of the graph alternately until all edges are oriented.
Bollobás, Béla   +4 more
core   +1 more source

Remarks on restrained domination and total restrained domination in graphs [PDF]

open access: yes, 2005
summary:The restrained domination number $\gamma ^r (G)$ and the total restrained domination number $\gamma ^r_t (G)$ of a graph $G$ were introduced recently by various authors as certain variants of the domination number $\gamma (G)$ of $(G)$.
Zelinka, Bohdan
core   +1 more source

Domination and forcing

open access: yes, 2018
This thesis comprises the results of five research papers on domination and zero forcing. In "Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence" (Gentner, Henning, Rautenbach, 2016) and "Smallest Domination
Gentner, Michael
core   +1 more source

Domination parameters: Roman domination number

open access: yes, 2022
Tezin 1. bölümünde, baskınlık sayısı ve Roman baskınlık sayısı tanımları verilerek, bu kavramlar günlük yaşamdan örnekler ile açıklanmıştır. Ardından Roman baskınlık sayısı için literatürde yer alan bazı sonuçlar verilmiştir. Tezin 2.
Zaim, Nurdan
core  

Home - About - Disclaimer - Privacy