A Simple Proof of an Inequality Connecting the Alternating Number of Independent Sets and the Decycling Number

Details A Simple Proof of an Inequality Connecting the Alternating Number of Independent Sets and the Decycling Number A Simple Proof of an Inequality Connecting the Alternating Number of Independent Sets and the Decycling Number

2009-05-21

arxiv.org/abs/0905.3487v1

Mathematics

Combinatorics

4 pages

Scientific paper

If alpha=alpha(G) is the maximum size of an independent set and s_{k} equals the number of stable sets of cardinality k in graph G, then I(G;x)=s_{0}+s_{1}x+...+s_{alpha}x^{alpha} is the independence polynomial of G. In this paper we provide an elementary proof of the inequality claiming that the absolute value of I(G;-1) is not greater than 2^phi(G), for every graph G, where phi(G) is its decycling number.

Affiliated with

Also associated with

No associations

Rating

A Simple Proof of an Inequality Connecting the Alternating Number of Independent Sets and the Decycling Number 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 A Simple Proof of an Inequality Connecting the Alternating Number of Independent Sets and the Decycling Number, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Simple Proof of an Inequality Connecting the Alternating Number of Independent Sets and the Decycling Number will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-445052