Results 1 to 10 of about 2,093,493 (279)
Upper paired domination versus upper domination [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A paired dominating set $P$ is a dominating set with the additional property that $P$ has a perfect matching. While the maximum cardainality of a minimal dominating set in a graph $G$ is called the upper domination number of $G$, denoted by $\Gamma(G ...
Hadi Alizadeh, Didem Gözüpek
doaj +10 more sources
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 +2 more
exaly +5 more sources
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 +2 more
exaly +5 more sources
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 +3 more sources
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 +2 more
exaly +4 more sources
Parameterized Complexity of Paired Domination [PDF]
International Workshop on Combinatorial AlgorithmsThe Paired Domination problem is one of the well-studied variants of the classical Dominating Set problem. In a graph G on nvertices, a dominating set D (set of vertices such that N[D] = V (G)) is called a paired dominating set of G, if G[D] has perfect ...
Tripathi, Vikash +5 more
core +4 more sources
Total Domination Versus Paired-Domination in Regular Graphs
Discussiones Mathematicae Graph Theory, 2018 A subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph
Cyman Joanna +4 more
doaj +4 more sources
Total and paired domination stability in prisms
Discussiones Mathematicae Graph Theory, 2023 A set $D$ of vertices in an isolate-free graph is a total dominating set if every vertex is adjacent to a vertex in $D$. If the set $D$ has the additional property that the subgraph induced by $D$ contains a perfect matching, then $D$ is a paired ...
Michael A. Henning +7 more
core +4 more sources
Domination and paired domination in Turiyam graphs with application
Scientific AfricanA potent tool in the theory of graphs, the Neutrosophic graph, is used to describe the variety of real-world cases with uncertainty brought on by ambiguous, inconsistent, and unpredictable data.
Abdata Guluma Erana +2 more
doaj +3 more sources
Paired-domination game played in graphs [PDF]
Communications in Combinatorics and Optimization, 2019 In this paper, we continue the study of the domination game in graphs introduced by Bre{\v{s}}ar, Klav{\v{z}}ar, and Rall [SIAM J. Discrete Math. 24 (2010) 979--991].
T.W. Haynes, Michael A. Henning
doaj +4 more sources