Results 11 to 20 of about 422,220 (274)
Maker-Breaker domination number [PDF]
Bulletin of the Malaysian Mathematical Sciences Society, 2019 The Maker-Breaker domination game is played on a graph $G$ by Dominator and Staller. The players alternatively select a vertex of $G$ that was not yet chosen in the course of the game.
Gledel, Valentin +2 more
core +4 more sources
Bounds on the Locating-Domination Number and Differentiating-Total Domination Number in Trees
Discussiones Mathematicae Graph Theory, 2018 A subset S of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V − S has a neighbor in S, and is a total dominating set if every vertex in V has a neighbor in S.
Rad Nader Jafari, Rahbani Hadi
doaj +2 more sources
On the equality of domination number and 2-domination number
Discussiones Mathematicae Graph TheoryThe 2-domination number $ _2(G)$ of a graph $G$ is the minimum cardinality of a set $ D \subseteq V(G) $ for which every vertex outside $ D $ is adjacent to at least two vertices in $ D $. Clearly, $ _2(G) $ cannot be smaller than the domination number $ (G) $. We consider a large class of graphs and characterize those members which satisfy $ _2=
Gülnaz Boruzanlı Ekinci +1 more
doaj +4 more sources
Discussiones Mathematicae Graph Theory, 2014 Let K3n denote the Cartesian product Kn□Kn□Kn, where Kn is the complete graph on n vertices.
Georges John, Lin Jianwei, Mauro David
doaj +3 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
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
On the Paired-Domination Subdivision Number of a Graph
Mathematics, 2021 In order to increase the paired-domination number of a graph G, the minimum number of edges that must be subdivided (where each edge in G can be subdivided no more than once) is called the paired-domination subdivision number sdγpr(G) of G.
Guoliang Hao +4 more
doaj +1 more source
Domination Subdivision Numbers
Discussiones Mathematicae Graph Theory, 2001 A set \(S\) of vertices of a graph \(G\) is a dominating set if every vertex of \(V(G)-S\) is adjacent to some vertex in \(S\). The domination number \(\gamma(G)\) is the minimum cardinality of a dominating set of \(G\), and the domination subdivision number \(\text{sd}_{\gamma}(G)\) is the minimum number of edges that must be subdivided (each edge in \
Haynes, Teresa W. +5 more
openaire +1 more source