On the bounds of feedback numbers of (n,k)-star graphs

  • Authors:

  • Jian Wang;Xirong Xu;Dejun Zhu;Liqing Gao;Jun-Ming Xu

  • Affiliations:

  • School of Computer Science and Technology, Dalian University of Technology, Dalian, 116024, China;School of Computer Science and Technology, Dalian University of Technology, Dalian, 116024, China;School of Computer Science and Technology, Dalian University of Technology, Dalian, 116024, China;School of Computer Science and Technology, Dalian University of Technology, Dalian, 116024, China;School of Mathematical Sciences, University of Science and Technology of China, Wentsun Wu Key Laboratory of CAS, Hefei, Anhui, 230026, China

  • Venue:
  • Information Processing Letters
  • Year:
  • 2012

Quantified Score

Hi-index 0.89

Visualization

Abstract

The feedback number of a graph G is the minimum number of vertices whose removal from G results in an acyclic subgraph. We use f(n,k) to denote the feedback number of the (n,k)-star graph S"n","k and p(n,k) the number of k-permutations of an n-element set. This paper proves thatp(n,k)-2(k-1)!(nk-1)=