Malaysian Journal of Mathematical Sciences, September 2016, Vol. 10, No. 3
Counting the Number of Weakly Connected Dominating Sets of Graphs
Saeid Alikhani, Somayeh Jahari and Mohammad Mehryar
Corresponding Email: alikhani@yazd.ac.ir
Received date: -
Accepted date: -
Abstract:
Let $G = (V(G), E(G))$ be a simple graph. A non-empty set $S\subseteq V(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)\setminus S$ is connected. In this paper, we consider some graphs and study the number of their weakly connected dominating sets.
Keywords: Dominating sets, Weakly connected, Path, Cycle
Indexing
