Counting the number of weakly connected dominating sets of graphs

MaRDI QIDQ6257637zbMATH OpenFDO

Authors Saeid Alikhani, Somayeh Jahari, Mohammad Mehryar

Publication date 28 December 2014

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: Let $G=(V(G),E(G))$ be a simple graph. A non-empty set $SsubseteqV(G)$ is a weakly connected dominating set in $G$, if the subgraph obtained from $G$ by removing all edges each joining any two vertices in $V(G)setminusS$ is connected. In this paper, we consider some graphs and study the number of their weakly connected dominating sets.

This page was built for publication: Counting the number of weakly connected dominating sets of graphs

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