Title of article
On the independence number of a graph in terms of order and size
Author/Authors
J. Harant، نويسنده , , I. Schiermeyer، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
8
From page
131
To page
138
Abstract
For the independence number α(G) of a connected graph G on n vertices with m edges the inequality α(G)⩾12[(2m+n+1)−(2m+n+1)2−4n2] is proved and its algorithmic realization is discussed.
Keywords
Stability , Independence
Journal title
Discrete Mathematics
Serial Year
2001
Journal title
Discrete Mathematics
Record number
949622
Link To Document