Edge-pancyclicity of pancake graph. Issue 3 (2nd July 2020)

• Record Type: Journal Article
• Authors: Hung, Chun-Nan; Abdallah, Mohamad; Weng, Jui-I; Kung, Tzu-Liang
• Is Part Of: International journal of computer mathematics. Volume 5:Issue 3(2020)
• Page Start: 125
• Page End: 133
• Publication Date: 2020-07-02
• Subjects: Pancake graph -- edge-pancylicity -- interconnection network -- cycle embedding -- Cayley graph; 68R10; Computer systems -- Periodicals; Computer systems; Periodicals; 004
• DOI: 10.1080/23799927.2020.1803972
• Languages: English
• ISSNs: 2379-9927

Abstract

ABSTRACT: Pancylicity was introduced by Bondy in 1971. A graph G with vertex set V ( G ) and edge set E ( G ) is pancyclic if it contains cycles of lengths l, for 3 ≤ l ≤ | V ( G ) | . 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 | V ( G ) |, G is k-edge-pancyclic . In this paper, we prove that the n -dimensional pancake graph is 7-edge-pancyclic.