On feedback number of folded hypercube
Nan Cao · Dalian Ligong Daxue xuebao · 2011
The feedback number of folded hypercube Qfn,which is an important interconnection network topological structure,is researched.Defining F as a feedback vertex set of Qfn,maximal acyclic subgraph of survived subgraph G[V(Qfn)-F] is construted and a minimal feedback vertex set is achieved.By this approach,the upper bound of feedback number of Qfn is obtained.According to the property of n-dimensional folded hypercube,a new approach to constructing acyclic subgraph is presented and the upper bound of feedback number of Qfn is improved.The conclusion indicates that the connectivity of acyclic subgraph of Qfn+2 constructed by the approach is consistent with the one of acyclic subgraph induced by R∪Qfon provided by related results when n is odd.