Results 21 to 30 of about 36,632 (251)
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 +3 more sources
Characterizations of trees with equal paired and double domination numbers
Discrete Mathematics, 2006 A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching, and a double dominating set is a dominating set that dominates every vertex of G at least twice.
Mostafa Blidia +2 more
exaly +2 more sources
Upper total domination versus upper paired-domination
Quaestiones Mathematicae, 2007 Let G be a graph with no isolated vertices. A set S of vertices in G is a total dominating set of G if every vertex of G is adjacent to some vertex in S, while a paired-dominating set of G is a dominating set of vertices whose induced subgraph has a ...
Paul Dorbec, Michael A Henning
exaly +1 more source
γ-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
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 domination versus domination and packing number in graphs
Journal of Combinatorial Optimization, 2022 14 pages, 8 ...
Magda Dettlaff +2 more
openaire +5 more sources
γ-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
Total and paired domination numbers of toroidal meshes [PDF]
Journal of Combinatorial Optimization, 2012 Let $G$ be a graph without isolated vertices. The total domination number of $G$ is the minimum number of vertices that can dominate all vertices in $G$, and the paired domination number of $G$ is the minimum number of vertices in a dominating set whose induced subgraph contains a perfect matching.
Fu-Tao Hu, Jun-Ming Xu 0001
openaire +3 more sources
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