文章基本信息
- 标题：On the Domination Polynomials of Complete Partite Graphs
- 本地全文：下载
- 作者：Saeid Alikhani ; Hamzeh Torabi
- 期刊名称：World Applied Sciences Journal
- 印刷版ISSN：1818-4952
- 电子版ISSN：1991-6426
- 出版年度：2010
- 卷号：9
- 期号：01
- 出版社：International Digital Organization for Scientific Information Publications
- 摘要：
Let G be a simple graph of order n. The domination polynomial of G is the polynomial
n i
D(G,x)=åi=1d(G,i)x , where d (G, i) is the number of dominating sets of G of size i. In this paper we study
the domination polynomials of complete n-partite graphs. - 关键词：Domination polynomial; complete partite graph
