Edge Weighting Functions on Semitotal Dominating Sets
Sign Up to like & getrecommendations! Published in 2017 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-017-1769-4
Abstract: A set S of vertices in an isolate-free graph G is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance 2 of another… read more here.
Keywords: domination number; semitotal dominating; edge weighting; dominating set ... See more keywords