On the number of outer connected dominating sets of graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2011
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909107840090112 |
|---|---|
| author | Alikhani, Saeid Akhbari, Mohammad H. Eslahchi, C. Hasni, Roslan |
| author_facet | Alikhani, Saeid Akhbari, Mohammad H. Eslahchi, C. Hasni, Roslan |
| contents | Let $G=(V,E)$ be a simple graph. A set $S\subseteq V(G)$ is called an outer-connected dominating set (or ocd-set) of $G$, if $S$ is a dominating set of $G$ and either $S=V(G)$ or $V\backslash S$ is a connected graph. In this paper we introduce a polynomial which its coefficients are the number of ocd-sets of $G$. We obtain some properties of this polynomial and its coefficients. Also we compute this polynomial for some specific graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1112_0846 |
| institution | arXiv |
| publishDate | 2011 |
| record_format | arxiv |
| spellingShingle | On the number of outer connected dominating sets of graphs Alikhani, Saeid Akhbari, Mohammad H. Eslahchi, C. Hasni, Roslan Combinatorics 05C69, 11B83 Let $G=(V,E)$ be a simple graph. A set $S\subseteq V(G)$ is called an outer-connected dominating set (or ocd-set) of $G$, if $S$ is a dominating set of $G$ and either $S=V(G)$ or $V\backslash S$ is a connected graph. In this paper we introduce a polynomial which its coefficients are the number of ocd-sets of $G$. We obtain some properties of this polynomial and its coefficients. Also we compute this polynomial for some specific graphs. |
| title | On the number of outer connected dominating sets of graphs |
| topic | Combinatorics 05C69, 11B83 |
| url | https://arxiv.org/abs/1112.0846 |