The Domination Polynomials of Cubic graphs of order 10
| dc.creator | Akbari, Saieed | |
| dc.creator | Alikhani, Saeid | |
| dc.creator | Peng, Yee-hock | |
| dc.date | 2009-05-20 | |
| dc.date.accessioned | 2026-07-07T13:16:47Z | |
| dc.date.available | 2026-07-07T13:16:47Z | |
| dc.description | Let G be a simple graph of order n. The domination polynomial of G is the polynomial D(G,x)=\sum_{i=γ(G)}^{n} d(G,i) x^{i}, where d(G,i) is the number of dominating sets of G of size i, and γ(G) is the domination number of G. In this paper we study the domination polynomials of cubic graphs of order 10. As a consequence, we show that the Petersen graph is determined uniquely by its domination polynomial. | |
| dc.description | 13 pages | |
| dc.identifier | https://arxiv.org/abs/0905.3281 | |
| dc.identifier | http://arxiv.org/abs/0905.3281 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/230903 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C60 | |
| dc.title | The Domination Polynomials of Cubic graphs of order 10 | |
| dc.type | text |