2021/05/22 by Yu-Zhe Liu, Shyue-Ming Tang, Liu, Yu-Zhe +4
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Interconnection Networks and Systems #graph theory and CDMA systems #math.CO
paper · pdf · doi:10.48550/arxiv.2105.10739
6 pages, 2 figures, conference paper published in 2017
arxiv created 2021/05/22 · openalex publication_date 2021/05/22 · arxiv updated 2021/05/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Bubble-sort star graphs are a combination of star graphs and bubble sort graphs. They are bipartite graphs and also form a family of Cayley graphs. The decycling number of a graph is the minimum number of vertices whose removal from the graph results in an acyclic subgraph. In this paper, we prove the decycling number D(n) of an n-dimensional bubble-sort star graph for n <= 5. We also show D(n) satisfies the inequalities for n >= 6.