Semipaired Domination in Some Subclasses of Chordal Graphs

@article{Henning2021SemipairedDI,
  title={Semipaired Domination in Some Subclasses of Chordal Graphs},
  author={Michael A. Henning and Arti Pandey and Vikash Tripathi},
  journal={Discret. Math. Theor. Comput. Sci.},
  year={2021},
  volume={23}
}
A dominating set $D$ of a graph $G$ without isolated vertices is called semipaired dominating set if $D$ can be partitioned into $2$-element subsets such that the vertices in each set are at distance at most $2$. The semipaired domination number, denoted by $\gamma_{pr2}(G)$ is the minimum cardinality of a semipaired dominating set of $G$. Given a graph $G$ with no isolated vertices, the \textsc{Minimum Semipaired Domination} problem is to find a semipaired dominating set of $G$ of cardinality… 

Figures from this paper

References

SHOWING 1-10 OF 19 REFERENCES
Semipaired domination in graphs
  • J. Combin. Math. Combin. Comput., 104
  • 2018
Complexity and Algorithms for Semipaired Domination in Graphs
TLDR
It is shown that the decision version of the \textsc{Minimum Semipaired Domination} problem is NP-complete for bipartite graphs and split graphs and a linear-time algorithm to compute a minimum cardinality semipaired dominating set of interval graphs and trees is presented.
Perfect graphs involving semitotal and semipaired domination
TLDR
Classes of perfect graphs are studied for the possible combinations of parameters in the inequalities when several such classes in terms of their minimal forbidden induced subgraphs are included in the mix.
Algorithmic Aspects of Semitotal Domination in Graphs
TLDR
It is proved that the \textsc{Minimum Semitotal Domination} problem is APX-complete for bipartite graphs with maximum degree $4 and cannot be approximated within $(1 - \epsilon)\ln |V|) unless NP $\subseteq$ DTIME$.
Domination versus semipaired domination in trees
Abstract In this paper, we study a parameter that is a relaxation of an important domination parameter, namely the paired domination. A set D of vertices in G is a semipaired dominating set of G if
Graphs With Large Semipaired Domination Number
TLDR
It is shown that if G is a connected graph G of order n ≥ 3, then γpr2 (G)≤23n ${\gamma _{{\rm{pr}}2}}(G) \le {2 \over 3}n$ , and the extremal graphs achieving equality in the bound is characterized.
Guoliang Hao
  • Domination versus semipaired domination in trees, Quaestiones Mathematicae
  • 2019
Semipaired domination in maximal outerplanar graphs
TLDR
It is shown that if n is a maximal outerplanar graph of order n with n2 vertices of degree 2, thenγpr2 (G) is the minimum cardinality of a semipaired dominating set of G and both bounds are shown to be tight.
Semipaired Domination in Claw-Free Cubic Graphs
TLDR
It is shown that if G is a claw-free, connected, cubic graph of order $$n \ge 10$$n≥10, thenγpr2(G) is the minimum cardinality of a semipaired dominating set of G.
Paired domination in graphs: A survey and recent results
  • Util Math, 94
  • 2014
...
1
2
...