Xirong Xu, Soomro Pir Dino, Huifeng Zhang, Huijun Jiang, Cong Liu
{"title":"Decycling Number of Crossed Cubes CQn","authors":"Xirong Xu, Soomro Pir Dino, Huifeng Zhang, Huijun Jiang, Cong Liu","doi":"10.1109/CIS.2017.00039","DOIUrl":null,"url":null,"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∊[0,1].","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 13th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2017.00039","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
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∊[0,1].
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
