Abstract
Pancylicity was introduced by Bondy in 1971. A graph G with vertex set (Formula presented.) and edge set (Formula presented.) is pancyclic if it contains cycles of lengths l, for (Formula presented.). This concept has been extended to edge-pancyclicity. If every edge of G is in a cycle of every length, G is edge-pancyclic. If every edge lies on cycles of all lengths ranging from k to (Formula presented.), G is k-edge-pancyclic. In this paper, we prove that the n-dimensional pancake graph is 7-edge-pancyclic.
Original language | English |
---|---|
Pages (from-to) | 125-133 |
Number of pages | 9 |
Journal | International Journal of Computer Mathematics: Computer Systems Theory |
Volume | 5 |
Issue number | 3 |
DOIs | |
State | Published - 2 Jul 2020 |
Keywords
- Cayley graph
- Pancake graph
- cycle embedding
- edge-pancylicity
- interconnection network