Some results on the super domination number of a graph II

Let [Formula: see text] be a simple graph. A dominating set of [Formula: see text] is a subset [Formula: see text] such that every vertex not in [Formula: see text] is adjacent to at least one vertex in [Formula: see text]. The cardinality of a smallest dominating set of [Formula: see text], denoted by [Formula: see text], is the domination number of [Formula: see text]. A dominating set [Formula: see text] is called a super dominating set of [Formula: see text], if for every vertex [Formula: see text], there exists [Formula: see text] such that [Formula: see text]. The cardinality of a smallest super dominating set of [Formula: see text], denoted by [Formula: see text], is the super domination number of [Formula: see text]. In this paper, we obtain more results on the super domination number of graphs which is modified by an operation on vertices. Also, we present some sharp bounds for super domination number of chain and bouquet of pairwise disjoint connected graphs.