QA408 : Semi-Strong Split Domination in Graphs
Thesis > Central Library of Shahrood University > Mathematical Sciences > MSc > 2017
Authors:
Abstarct: Let G be a graph. A set D ⊆V of vertices in a graph G is called a dominating set if every vertex in V-D is adjacent to a vertex in D. A dominating set D is a split dominating .....
Keywords:
#dominating set #split dominating set #strong split dominating set #semi-strong split dominating set Link
Keeping place: Central Library of Shahrood University
Visitor:
Keeping place: Central Library of Shahrood University
Visitor: