2019/07/15 by Jia Guo, Mei Lu, Guo, Jia +1
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Interconnection Networks and Systems #math.CO
paper · pdf · doi:10.48550/arxiv.1907.06378
13 pages, 5 figures, 6 tables
arxiv created 2019/07/15 · openalex publication_date 2019/07/15 · arxiv updated 2019/07/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The interconnection network considered in this paper is the bubble-sort star graph. The n-dimensional bubble-sort star graph BSn is a bipartite and (2n-3)-regular graph of order n!. A bipartite graph G is edge-bipancyclic if each edge of G lies on a cycle of all even length l with 4≤ l≤ |V(G)|. In this paper, we show that the n-dimensional bubble-sort star graph BSn is edge-bipancyclic for n≥ 3 and for each even length l with 4≤ l≤ n!, every edge of BSn lies on at least four different cycles of length l.