- Tytuł:
- On k-Path Pancyclic Graphs
- Autorzy:
-
Bi, Zhenming
Zhang, Ping - Powiązania:
- https://bibliotekanauki.pl/articles/31339488.pdf
- Data publikacji:
- 2015-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
Hamiltonian
panconnected
pancyclic
path Hamiltonian
path pancyclic - Opis:
- For integers k and n with 2 ≤ k ≤ n − 1, a graph G of order n is k-path pancyclic if every path P of order k in G lies on a cycle of every length from k + 1 to n. Thus a 2-path pancyclic graph is edge-pancyclic. In this paper, we present sufficient conditions for graphs to be k-path pancyclic. For a graph G of order n ≥ 3, we establish sharp lower bounds in terms of n and k for (a) the minimum degree of G, (b) the minimum degree-sum of nonadjacent vertices of G and (c) the size of G such that G is k-path pancyclic
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2015, 35, 2; 271-281
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł