Results 11 to 20 of about 9,014,600 (248)
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 +3 more sources
Distance paired domination numbers of graphs [PDF]
Discrete Mathematics, 2008 Let \(G=(V,E)\) be a graph without an isolated vertex. A set \(D\subset V(G)\) is a dominating set of \(G\) if every vertex in \(V(G)-D\) is adjacent to at least one vertex in \(D\). A set \(D\subset V(G)\) is a paired dominating set of \(G\) if it is dominating and the indiced subgraph \(\) has a perfect matching.
Raczek, Joanna
openaire +4 more sources
Total Domination Versus Paired-Domination in Regular Graphs [PDF]
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 +3 more sources
γ-paired dominating graphs of cycles [PDF]
Opuscula Mathematica, 2022 A paired dominating set of a graph \(G\) is a dominating set whose induced subgraph contains a perfect matching. The paired domination number, denoted by \(\gamma_{pr}(G)\), is the minimum cardinality of a paired dominating set of \(G\).
Pannawat Eakawinrujee +1 more
doaj +1 more source
Paired domination versus domination and packing number in graphs
Journal of Combinatorial Optimization, 2022 14 pages, 8 ...
Magda Dettlaff +2 more
openaire +7 more sources
Unique Minimum Semipaired Dominating Sets in Trees
Discussiones Mathematicae Graph Theory, 2023 Let G be a graph with vertex set V. A subset S ⊆ V is a semipaired dominating set of G if every vertex in V \ S is adjacent to a vertex in S and S can be partitioned into two element subsets such that the vertices in each subset are at most distance two ...
Haynes Teresa W., Henning Michael A.
doaj +1 more source
Journal of New Theory, 2023 In this study, transformation graphs obtained from the concept of the total graph and the result of its paired domination number for some special graph families are discussed.
Hande Tunçel Gölpek
doaj +1 more source
γ-Paired dominating graphs of lollipop, umbrella and coconut graphs
Electronic Journal of Graph Theory and Applications, 2023 A paired dominating set of a graph G is a dominating set whose induced subgraph has a perfect matching. The paired domination number γpr(G) of G is the minimum cardinality of a paired dominating set. A paired dominating set D is a γpr(G)-set if |D|=γpr(G)
Pannawat Eakawinrujee +1 more
doaj +1 more source
Neighbourhood total domination in graphs [PDF]
Opuscula Mathematica, 2011 Let \(G = (V,E)\) be a graph without isolated vertices. A dominating set \(S\) of \(G\) is called a neighbourhood total dominating set (ntd-set) if the induced subgraph \(\langle N(S)\rangle\) has no isolated vertices.
S. Arumugam, C. Sivagnanam
doaj +1 more source
Equitable and Paired Equitable Domination in Inflated Graphs and Their Complements
Axioms, 2023 Domination plays an indispensable role in graph theory. Various types of domination explore various types of applications. Equal-status people work together and interlace with each other easily.
Narayanan Kumaran +4 more
doaj +1 more source