Edge-pancyclicity of pancake graph

Chun Nan Hung, Mohamad Abdallah, Jui I. Weng, Tzu Liang Kung

Research output: Contribution to journalReview articlepeer-review

2 Scopus citations

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 languageEnglish
Pages (from-to)125-133
Number of pages9
JournalInternational Journal of Computer Mathematics: Computer Systems Theory
Volume5
Issue number3
DOIs
StatePublished - 2 Jul 2020

Keywords

  • Cayley graph
  • Pancake graph
  • cycle embedding
  • edge-pancylicity
  • interconnection network

Fingerprint

Dive into the research topics of 'Edge-pancyclicity of pancake graph'. Together they form a unique fingerprint.

Cite this