点击次数：

论文类型：会议论文

发表时间：2017-01-01

收录刊物：SCIE、CPCI-S

卷号：2018-January

页面范围：145-150

关键字：Decycling Set; Decycling Number; Crossed Cubes; Acyclic Subgraph

摘要：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 CQ(n) and proves that for any integer n >= 2, the decycling number of CQ(n) is 2(n-1).(1-c/n-1), c is an element of [0, 1].