A new lower bound on the independence number of a graph

13 years 11 months ago

Download www.optimization-online.org

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.

Ossama Kettani

Real-time Traffic

Connected Graph | CORR 2007 | Education | Independence Number | Min Algorithm |

claim paper

» Polynomial Vicinity Circuits and Nonlinear Lower Bounds

» New Lower Bounds For Orthogonal Drawings

» Interpolating between bounds on the independence number

» Complete Minors and Independence Number

» Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangula...

» An optimal maximal independent set algorithm for boundedindependence graphs

» The independence number in graphs of maximum degree three

» CrossComposition A New Technique for Kernelization Lower Bounds

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	CORR
Authors	Ossama Kettani

Comments (0)

Sciweavers

A new lower bound on the independence number of a graph

Connected Graph | CORR 2007 | Education | Independence Number | Min Algorithm |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers