- Tytuł:
- On Minimum (Kq, k) Stable Graphs
- Autorzy:
-
Fouquet, J.L.
Thuillier, H.
Vanherpe, J.M.
Wojda, A.P. - Powiązania:
- https://bibliotekanauki.pl/articles/30146732.pdf
- Data publikacji:
- 2013-03-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
- stable graphs
- Opis:
- A graph G is a (Kq, k) stable graph (q ≥ 3) if it contains a Kq after deleting any subset of k vertices (k ≥ 0). Andrzej Żak in the paper On (Kq; k)-stable graphs, ( doi:/10.1002/jgt.21705) has proved a conjecture of Dudek, Szymański and Zwonek stating that for sufficiently large k the number of edges of a minimum (Kq, k) stable graph is (2q − 3)(k + 1) and that such a graph is isomorphic to sK2q−2 + tK2q−3 where s and t are integers such that s(q − 1) + t(q − 2) − 1 = k. We have proved (Fouquet et al. On (Kq, k) stable graphs with small k, Elektron. J. Combin. 19 (2012) #P50) that for q ≥ 5 and k ≤ q/2 +1 the graph Kq+k is the unique minimum (Kq, k) stable graph. In the present paper we are interested in the (Kq, κ(q)) stable graphs of minimum size where κ(q) is the maximum value for which for every nonnegative integer k < κ(q) the only (Kq, k) stable graph of minimum size is Kq+k and by determining the exact value of κ(q).
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2013, 33, 1; 101-115
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł