LAUSR

Complexity and Algorithms for Semipaired Domination in Graphs

Sign Up to like & get
recommendations!
0 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