Connected cototal domination number of a graph
| Autor: | B Basavanagoud, Sunilkumar M Hosamani |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2012 |
| Předmět: | |
| Zdroj: | Transactions on Combinatorics, Vol 1, Iss 2, Pp 17-25 (2012) |
| Druh dokumentu: | article |
| ISSN: | 2251-8657 2251-8665 |
| Popis: | 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 cototal dominating set. The connected cototal domination number $gamma_{ccl}(G)$ of $G$ is the minimum cardinality of a minimal connected cototal dominating set of $G$. In this paper, we begin an investigation of connected cototal domination number and obtain some interesting results. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|