Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number

Mustapha Aouchiche, Gunnar Brinkmann, Pierre Hansen

Research output: Contribution to journalArticlepeer-review

15 Citations (Scopus)

Abstract

A set of vertices S in a graph G is independent if no neighbor of a vertex of S belongs to S. The independence number α is the maximum cardinality of an independent set of G. A series of best possible lower and upper bounds on α and some other common invariants of G are obtained by the system AGX 2, and proved either automatically or by hand. In the present paper, we report on such lower and upper bounds considering, as second invariant, minimum, average and maximum degree, diameter, radius, average distance, spread of eccentricities, chromatic number and matching number.

Original languageEnglish
Pages (from-to)2530-2542
Number of pages13
JournalDiscrete Applied Mathematics
Volume156
Issue number13
DOIs
Publication statusPublished - Jul 6 2008
Externally publishedYes

Keywords

  • AGX
  • Extremal graph
  • Independence number
  • Invariant

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number'. Together they form a unique fingerprint.

Cite this