Release Time:2019-03-12  Hits:

Indexed by: Conference Paper

Date of Publication: 2017-01-01

Included Journals: CPCI-S、SCIE

Volume: 2018-January

Page Number: 145-150

Key Words: Decycling Set; Decycling Number; Crossed Cubes; Acyclic Subgraph

Abstract: 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].