On the bounds of feedback numbers of (n,k)-star graphs
From MaRDI portal
Publication:436576
DOI10.1016/J.IPL.2012.03.014zbMATH Open1243.05115OpenAlexW2117454844MaRDI QIDQ436576FDOQ436576
Authors: Jian Wang, Xirong Xu, Dejun Zhu, Liqing Gao, Jun-Ming Xu 
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
Recommendations
- scientific article; zbMATH DE number 6403923
- Feedback vertex sets in star graphs
- Bounding the feedback vertex number of digraphs in terms of vertex degrees
- Feedback numbers of Kautz undirected graphs
- The size of graphs with given feedback vertex number
- Bounds on feedback numbers of de Bruijn graphs
- Bounds on the upper \(k\)-domination number and the upper \(k\)-star-forming number of a graph
- Some notes on bounded starwidth graphs
- scientific article; zbMATH DE number 3972888
- Feedback vertex number of Sierpiński-type graphs
Graph algorithms (graph-theoretic aspects) (05C85) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Cites Work
Cited In (8)
- Fault-tolerance of \((n, k)\)-star networks
- Maximum independent sets partition of \((n, k)\)-star graphs
- Title not available (Why is that?)
- Bounding the feedback vertex number of digraphs in terms of vertex degrees
- Bounds on feedback numbers of de Bruijn graphs
- Feedback vertex set in alternating group graphs
- The decycling number of generalized Petersen graphs
- Decycling bubble sort graphs
This page was built for publication: On the bounds of feedback numbers of \((n,k)\)-star graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436576)
