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

DOI10.1016/j.ipl.2012.03.014zbMath1243.05115OpenAlexW2117454844MaRDI QIDQ436576

Xirong Xu, Liqing Gao, Jian Wang, Jun-Ming Xu, Dejun Zhu

Publication date: 25 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.03.014

zbMATH Keywords

cyclesnetworkscombinatorial problemsacyclic subgraphfeedback set\((nfeedback numberk)\)-star graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Fault-tolerance of \((n, k)\)-star networks ⋮ The decycling number of generalized Petersen graphs ⋮ Decycling bubble sort graphs ⋮ Maximum independent sets partition of \((n, k)\)-star graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Feedback vertex set in hypercubes
• Bounds on feedback numbers of de Bruijn graphs
• Feedback vertex sets in star graphs
• The \((n,k)\)-star graph: A generalized star graph
• Theory and Application of Graphs