On minimum (Kq; k) stable graphs

Abstract : 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}.
Document type :
Reports
Liste complète des métadonnées

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-00648505
Contributor : Henri Thuillier <>
Submitted on : Monday, December 5, 2011 - 10:42:07 PM
Last modification on : Thursday, February 7, 2019 - 2:22:29 PM
Document(s) archivé(s) le : Tuesday, March 6, 2012 - 2:42:08 AM

Files

Kappa_q_.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00648505, version 1

Collections

Citation

Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, Adam Pawel Wojda. On minimum (Kq; k) stable graphs. [Research Report] 2011, pp.9. ⟨hal-00648505⟩

Share

Metrics

Record views

290

Files downloads

94