Dominating Sets and Domination Polynomials of Graphs
This thesis introduces domination polynomial of a graph. The domination polynomial of a graph G of order n is the polynomial D(G; x) = Pn i=°(G) d(G; i)xi, where d(G; i) is the number of dominating sets of G of size i, and °(G) is the domination number of G. We obtain some properties of this pol...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 语言: | English English |
| 出版: |
2009
|
| 主题: | |
| 在线阅读: | http://psasir.upm.edu.my/id/eprint/7250/1/IPM_2009_7a.pdf |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|