Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: panconnected

Sortuj według:

Ogranicz wyniki do:

On k-Path Pancyclic Graphs

100%

Bi Z., Zhang P.

Discussiones Mathematicae Graph Theory

2015

tom 35

nr 2

271-281

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

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Bi Z.

1 Zhang P.

1 2015

Wyniki wyszukiwania

On k-Path Pancyclic Graphs