Enumeration of accurate dominating sets

MaRDI QIDQ6358978zbMATH OpenFDO

Authors Saeid Alikhani, Maryam Safazadeh, N. Ghanbari

Publication date 22 January 2021

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Abstract: Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $DsubseteqV$ such that every vertex not in $D$ is adjacent to at least one vertex in $D$. The cardinality of a smallest dominating set of $G$, denoted by $gamma(G)$, is the domination number of $G$. A dominating set $D$ is an accurate dominating set of $G$, if no $|D|$-element subset of $VsetminusD$ is a dominating set of $G$. The accurate domination number, $gamm{a}_a(G)$, is the cardinality of a smallest accurate dominating set $D$. In this paper, after presenting preliminaries, we count the number of accurate dominating sets of some specific graphs.

This page was built for publication: Enumeration of accurate dominating sets

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