Complexity and Algorithms for Semipaired Domination in Graphs
Sign Up to like & getrecommendations! Published in 2020 at "Theory of Computing Systems"
DOI: 10.1007/s00224-020-09988-3
Abstract: For a graph G = ( V , E ) with no isolated vertices, a set D ⊆ V $D\subseteq V$ is called a semipaired dominating set of G if ( i ) D is… read more here.
Keywords: graphs; semipaired domination; minimum semipaired; dominating set ... See more keywords
Domination versus semipaired domination in trees
Sign Up to like & getrecommendations! Published in 2019 at "Quaestiones Mathematicae"
DOI: 10.2989/16073606.2019.1641566
Abstract: 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… read more here.
Keywords: domination number; semipaired domination; domination versus; dominating set ... See more keywords