A new lower bound on the independence number of a graph
| dc.creator | Kettani, O. | |
| dc.date | 2007-06-18 | |
| dc.date | 2007-06-20 | |
| dc.date.accessioned | 2026-07-07T08:10:58Z | |
| dc.date.available | 2026-07-07T08:10:58Z | |
| dc.description | 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. | |
| dc.description | 4 pages | |
| dc.identifier | https://arxiv.org/abs/0706.2575 | |
| dc.identifier | http://arxiv.org/abs/0706.2575 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/131979 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | F.2.2 | |
| dc.title | A new lower bound on the independence number of a graph | |
| dc.type | text |