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 polynom...
Saved in:
Main Author: | |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2009
|
Online Access: | http://ethesis.upm.edu.my/id/eprint/409/1/IPM_2009_7_F.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|