Alikhania, Saeid and Yee-hock, Peng (2008) Dominating Sets and Domination Polynomials of Cycles. Global Journal of Pure And Applied Mathematics, 4 (2). pp. 202-210.
Official URL: http://arxiv.org/PS_cache/arxiv/pdf/0905/0905.3268...
Let G = (V,E) be a simple graph. A set S ⊆ V is a dominating set of G, if every vertex in V \S is adjacent to at least one vertex in S. Let Ci n be the family of dominating sets of a cycle Cn with cardinality i, and let d(Cn, i) = |Ci n|. In this paper, we construct Ci n,and obtain a recursive formula for d(Cn, i). Using this recursive formula, we consider the polynomial D(Cn, x) = Pn i=⌈ n 3 ⌉ d(Cn, i)xi, which we call domination polynomial of cycles and obtain some properties of this polynomial.
|Keyword:||Dominating sets,Domination Polynomial,Recursive formula, Cycle|
|Faculty or Institute:||Faculty of Science|
|Deposited By:||Najwani Amir Sariffudin|
|Deposited On:||09 Jun 2010 03:02|
|Last Modified:||27 May 2013 07:33|
Repository Staff Only: item control page
Document Download Statistics
This item has been downloaded for since 09 Jun 2010 03:02.