On $({K}\_{q},k)$ vertex stable graphs with minimum size
Résumé
A graph G is a (Kq; k) vertex stable graph if it contains a Kq after deleting any subset of k vertices. We give a characterization of (Kq; k) vertex stable graphs with minimum size for q = 3; 4; 5.
Domaines
Mathématique discrète [cs.DM]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...