Results 11 to 20 of about 423,219 (274)
The Domination Number of Grids [PDF]
SIAM Journal on Discrete Mathematics, 2011 In this paper, we conclude the calculation of the domination number of all $n\times m$ grid graphs. Indeed, we prove Chang's conjecture saying that for every $16\le n\le m$, $\gamma(G_{n,m})=\lfloor\frac{(n+2)(m+2)}{5}\rfloor -4$.Comment: 12 pages, 4 ...
Alexandre Pinlou +9 more
core +6 more sources
Bipartite graphs with close domination and k-domination numbers [PDF]
Open Mathematics, 2020 Abstract Let k k be a positive integer and let G
Ekinci, Gulnaz Boruzanli, Bujtas, Csilla
openaire +4 more sources
Paired domination versus domination and packing number in graphs
Journal of Combinatorial Optimization, 2022 14 pages, 8 ...
Dettlaff, Magda +2 more
openaire +5 more sources
Stability of Domination in Graphs
Ratio Mathematica, 2023 The stability of dominating sets in Graphs is introduced and studied, in this paper. Here D is a dominating set of Graph G. In this paper the vertices of D and vertices of $V - D$ are called donors and acceptors respectively.
Reeja Kuriakose, K. S Parvathy
doaj +1 more source
On domination multisubdivision number of unicyclic graphs [PDF]
Opuscula Mathematica, 2018 The paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram,
Joanna Raczek
doaj +1 more source
A Note on the Paired-Domination Subdivision Number of Trees
Mathematics, 2021 For a graph G with no isolated vertex, let γpr(G) and sdγpr(G) denote the paired-domination and paired-domination subdivision numbers, respectively. In this note, we show that if T is a tree of order n≥4 different from a healthy spider (subdivided star),
Xiaoli Qiang +5 more
doaj +1 more source
Characterization of outerplanar graphs with equal 2-domination and domination numbers
Theory and Applications of Graphs, 2022 A {\em $k$-domination number} of a graph $G$ is minimum cardinality of a $k$-dominating set of $G$, where a subset $S \subseteq V(G)$ is a {\em $k$-dominating set} if each vertex $v\in V(G)\setminus S$ is adjacent to at least $k$ vertices in $S$.
Naoki Matsumoto
doaj +1 more source
On the Paired-Domination Subdivision Number of Trees
Mathematics, 2021 A paired-dominating set of a graph G without isolated vertices is a dominating set of vertices whose induced subgraph has perfect matching. The minimum cardinality of a paired-dominating set of G is called the paired-domination number γpr(G) of G.
Shouliu Wei +4 more
doaj +1 more source
On the edge geodetic and edge geodetic domination numbers of a graph [PDF]
Communications in Combinatorics and Optimization, 2020 In this paper, we study both concepts of geodetic dominating and edge geodetic dominating sets and derive some tight upper bounds on the edge geodetic and the edge geodetic domination numbers.
Vladimir Samodivkin
doaj +1 more source
The paired-domination and the upper paired-domination numbers of graphs [PDF]
Opuscula Mathematica, 2015 In this paper we continue the study of paired-domination in graphs. A paired-dominating set, abbreviated PDS, of a graph \(G\) with no isolated vertex is a dominating set of vertices whose induced subgraph has a perfect matching.
Włodzimierz Ulatowski
doaj +1 more source