Cycles are determined by their domination polynomials

Details Cycles are determined by their domination polynomials Cycles are determined by their domination polynomials

2009-08-23

arxiv.org/abs/0908.3305v1

Mathematics

Combinatorics

To appear in Ars Combinatoria

Scientific paper

Let $G$ be a simple graph of order $n$. A dominating set of $G$ is a set $S$ of vertices of $G$ so that every vertex of $G$ is either in $S$ or adjacent to a vertex in $S$. The domination polynomial of $G$ is the polynomial $D(G,x)=\sum_{i=1}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. In this paper we show that cycles are determined by their domination polynomials.

Affiliated with

Also associated with

No associations

Rating

Cycles are determined by their domination polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cycles are determined by their domination polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cycles are determined by their domination polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-363897