Dominating sets and Domination polynomials of Cycles
| dc.creator | Alikhani, Saeid | |
| dc.creator | Peng, Yee-hock | |
| dc.date | 2009-05-20 | |
| dc.date.accessioned | 2026-07-07T13:16:46Z | |
| dc.date.available | 2026-07-07T13:16:46Z | |
| dc.description | Let G=(V,E) be a simple graph. A set S\subset V is a dominating set of G, if every vertex in V§is adjacent to at least one vertex in S. Let {\mathcal C}_n^i be the family of dominating sets of a cycle C_n with cardinality i, and let d(C_n,i) = |{\mathcal C}_n^i. In this paper, we construct {\mathcal C}_n^i, and obtain a recursive formula for d(C_n, i). Using this recursive formula, we consider the polynomial D(C_n, x) = \sum_{i=1}^n d(C_n, i)x^i, which we call domination polynomial of cycles and obtain some properties of this polynomial. | |
| dc.description | 13 pages. Accepted in http://www.ripublication.com/gjpam.htm | |
| dc.identifier | https://arxiv.org/abs/0905.3268 | |
| dc.identifier | http://arxiv.org/abs/0905.3268 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/230900 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C69, 11B83 | |
| dc.title | Dominating sets and Domination polynomials of Cycles | |
| dc.type | text |