An improvement of fraisse's sufficient c
✍
A. Ainouche
📂
Article
📅
1992
🏛
John Wiley and Sons
🌐
English
⚖ 567 KB
## Abstract Let __G__ be a __k__‐connected graph of order __n__. For an independent set c, let __d(S)__ be the number of vertices adjacent to at least one vertex of __S__ and > let i(S) be the number of vertices adjacent to at least |S| vertices of __S__. We prove that if there exists some s, 1 ≤ s