| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418604 | Discrete Applied Mathematics | 2015 | 5 Pages |
Abstract
The decycling number of a graph GG is the minimum number of vertices whose removal from GG results in an acyclic subgraph. In this paper we show that the decycling number f(n)f(n) of the bubble sort graph BnBn satisfies these inequalities: n!(n−3)2(n−2)+1≤f(n)≤n!(2n−3)4(n−1).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jian Wang, Xirong Xu, Liqing Gao, Sijia Zhang, Yuansheng Yang,