-

 

 

 




Optimization Online





 

A new lower bound on the independence number of a graph

O. Kettani(o_ket1***at***yahoo.fr)

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

Keywords: independence number, min algorithm, connected graph

Category 1: Combinatorial Optimization (Graphs and Matroids )

Citation:

Download: [PDF]

Entry Submitted: 12/04/2009
Entry Accepted: 12/07/2009
Entry Last Modified: 12/04/2009

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society