| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647924 | Discrete Mathematics | 2012 | 10 Pages |
Abstract
A graph GG is a (Kq,k)(Kq,k) vertex stable graph if it contains a KqKq after deleting any subset of kk vertices. We give a characterization of (Kq,k)(Kq,k) vertex stable graphs with minimum size for q=3,4,5q=3,4,5.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
J.-L. Fouquet, H. Thuillier, J.-M. Vanherpe, A.P. Wojda,