- Tytuł:
- On the stability for pancyclicity
- Autorzy:
- Schiermeyer, Ingo
- Powiązania:
- https://bibliotekanauki.pl/articles/743483.pdf
- Data publikacji:
- 2001
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
pancyclic graphs
stability - Opis:
- A property P defined on all graphs of order n is said to be k-stable if for any graph of order n that does not satisfy P, the fact that uv is not an edge of G and that G + uv satisfies P implies $d_G(u) + d_G(v) < k$. Every property is (2n-3)-stable and every k-stable property is (k+1)-stable. We denote by s(P) the smallest integer k such that P is k-stable and call it the stability of P. This number usually depends on n and is at most 2n-3. A graph of order n is said to be pancyclic if it contains cycles of all lengths from 3 to n. We show that the stability s(P) for the graph property "G is pancyclic" satisfies max(⎡6n/5]⎤-5, n+t) ≤ s(P) ≤ max(⎡4n/3]⎤-2,n+t), where t = 2⎡(n+1)/2]⎤-(n+1).
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2001, 21, 2; 223-228
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł