Some results on the super domination number of a graph

Author:
Publisher website
Google Scholar
Abstract
Let [ ] be a simple graph. A dominating set of [ ] is a subset [ ] such that every vertex not in [ ] is adjacent to at least one vertex in [ ]. The cardinality of a smallest dominating set of [ ], denoted by [ ], is the domination number of [ ]. A dominating set [ ] is called a super dominating set of [ ], if for every vertex [ ], there exists [ ] such that [ ]. The cardinality of a smallest super dominating set of [ ], denoted by [ ], is the super domination number of [ ]. In this paper, we study super domination number of some graph classes and present sharp bounds for some graph operations.

This publication has 7 references indexed in Scilit: