A new lower bound on the independence number of a graph

Details A new lower bound on the independence number of a graph A new lower bound on the independence number of a graph

2007-06-18

arxiv.org/abs/0706.2575v2

Computer Science

Discrete Mathematics

4 pages

Scientific paper

For a given connected graph G on n vertices and m edges, we prove that its
independence number is at least (2m+n+2-sqrt(sqr(2m+n+2)-16sqr(n)))/8.

Affiliated with

Also associated with

No associations

Rating

A new lower bound on the independence number of a graph 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 new lower bound on the independence number of a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new lower bound on the independence number of a graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-609807