Decycling Number of Crossed Cubes CQn
Xirong Xu, Pir Dino Soomro, Huifeng Zhang, Huijun Jiang, Cong Liu · 2017
A subset of vertices of a graph G is called a decycling set of G if its deletion results in an acyclic subgraph. The cardinality of a minimum decycling set is called the decycling number of G. This paper presents an approach to construct an acyclic subgraph of CQnand proves that for any integer n ≥ 2, the decycling number of CQnis 2n-1·(1-c/n-1), cϵ[0,1].