Dominating Sets and Domination Polynomials of Cycles

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.

[img] PDF

Official URL:


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.

Item Type:Article
Keyword:Dominating sets,Domination Polynomial,Recursive formula, Cycle
Faculty or Institute:Faculty of Science
ID Code:7111
Deposited By: Najwani Amir Sariffudin
Deposited On:09 Jun 2010 03:02
Last Modified:27 May 2013 07:33

Repository Staff Only: Edit item detail

Document Download Statistics

This item has been downloaded for since 09 Jun 2010 03:02.

View statistics for "Dominating Sets and Domination Polynomials of Cycles"

Universiti Putra Malaysia Institutional Repository

Universiti Putra Malaysia Institutional Repository is an on-line digital archive that serves as a central collection and storage of scientific information and research at the Universiti Putra Malaysia.

Currently, the collections deposited in the IR consists of Master and PhD theses, Master and PhD Project Report, Journal Articles, Journal Bulletins, Conference Papers, UPM News, Newspaper Cuttings, Patents and Inaugural Lectures.

As the policy of the university does not permit users to view thesis in full text, access is only given to the first 24 pages only.