Some results on the super domination number of a graph

arXiv2204.10666MaRDI QIDQ6397201FDOQ6397201

N. Ghanbari

Publication date: 22 April 2022

Abstract: Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $SsubseteqV$ such that every vertex not in $S$ is adjacent to at least one vertex in $S$. The cardinality of a smallest dominating set of $G$, denoted by $gamma(G)$, is the domination number of $G$. A dominating set $S$ is called a super dominating set of $G$, if for every vertex $uinoverlineS=V-S$, there exists $vinS$ such that $N(v)capoverlineS=u$. The cardinality of a smallest super dominating set of $G$, denoted by $gamm{a}_{sp}(G)$, is the super domination number of $G$. In this paper, we study super domination number of some graph classes and present sharp bounds for some graph operations.

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

This page was built for publication: Some results on the super domination number of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6397201)