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
EDGE WEIGHTING FUNCTIONS ON THE SEMITOTAL DOMINATING SET OF CLAW-FREE GRAPHS
Sign Up to like & getrecommendations! Published in 2024 at "Bulletin of the Australian Mathematical Society"
DOI: 10.1017/s0004972724000017
Abstract: Abstract In an isolate-free graph G, a subset S of vertices is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance 2… read more here.
Keywords: dominating set; claw free; semitotal dominating; graphs ... See more keywords