Connected cototal domination number of a graph
A dominating set $D subseteq V$ of a graph $G = (V,E)$ is said to be a connected cototal dominating set if $langle D rangle$ is connected and $langle V-D rangle neq phi$, contains no isolated vertices. A connected cototal dominating set is said to be minimal if no proper subset of $D$ is connected c...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2012-06-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://www.combinatorics.ir/?_action=showPDF&article=820&_ob=bd185d6e0dce9d0bea5fb29b49ff1348&fileName=full_text.pdf |