 |
Université d'Orléans |  |
|
Université d'Orléans | |
| HAL: hal-00648505, version 1 |
| See detailed view |  BibTeX,EndNote,... |
 |
|
|
| On minimum (Kq; k) stable graphs |
|
|
Jean-Luc Fouquet 1Henri Thuillier 1 |
|
|
| (2011) |
|
|
|
| A graph G is a (K_q; k) vertex stable graph (q >= 3) if it contains a clique K_q after deleting any subset of k vertices (k >= 0). We are interested by the (K_q; kappa(q)) vertex stable graphs of minimum size where kappa(q) is the maximum value for which for every nonnegative integer k < kappa(q) the only (Kq; k) vertex stable graph of minimum size is K_{q+k}. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
| 2: | AGH (AGH) |
|
|
|
University of Science and Technology |
|
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Discrete Mathematics |
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| hal-00648505, version 1 | |
| http://hal.inria.fr/hal-00648505 | |
| oai:hal.inria.fr:hal-00648505 | |
| From: Henri Thuillier | |
| Submitted on: Monday, 5 December 2011 22:42:07 | |
| Updated on: Tuesday, 6 December 2011 10:34:32 | |
