On the Domination Polynomial of Some Graph Operations

Let G be a simple graph of order n. The domination polynomial of G is the polynomial D(G,λ)=∑i=0n‍d(G,i)λi, where d(G,i) is the number of dominating sets of G of size i. Every root of D(G,λ) is called the domination root of G. In this paper, we study the domination polynomial of some graph operation...

Full description

Saved in:

Bibliographic Details
Published in	ISRN Combinatorics Vol. 2013; pp. 1 - 3
Main Author	Alikhani, Saeid
Format	Journal Article
Language	English
Published	Hindawi Publishing Corporation 27.08.2013
Online Access	Get full text

Cover

Loading…

More Information
Summary:	Let G be a simple graph of order n. The domination polynomial of G is the polynomial D(G,λ)=∑i=0n‍d(G,i)λi, where d(G,i) is the number of dominating sets of G of size i. Every root of D(G,λ) is called the domination root of G. In this paper, we study the domination polynomial of some graph operations.
ISSN:	2090-8911 2090-8911
DOI:	10.1155/2013/146595