On the number of isolate dominating sets of certain graphs

MaRDI QIDQ6358098zbMATH OpenFDO

Authors N. Ghanbari, Saeid Alikhani

Publication date 12 January 2021

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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 an isolate dominating set of $G$, if the induced subgraph $G[S]$ has at least one isolated vertex. The isolate domination number, $gamm{a}_0(G)$, is the minimum cardinality of an isolate dominating set of $G$. In this paper, we count the number of isolate dominating sets of some specific graphs.

This page was built for publication: On the number of isolate dominating sets of certain graphs

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