A new lower bound on the independence number of a graph

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) -((2m+n+2)2 -16n2 )½ )/8. Keywords : independence number, min algorithm, connected graph.

• Type: Journal
• Year: 2007
• Where: CORR
• Authors: Ossama Kettani
• Keywords: Connected Graph, CORR 2007, Education, Independence Number, Min Algorithm