On the bounds of feedback numbers of (n,k)-star graphs
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 1744105 (Why is no real title available?)
- scientific article; zbMATH DE number 6403923 (Why is no real title available?)
- Bounds on feedback numbers of de Bruijn graphs
- Feedback vertex set in hypercubes
- Feedback vertex sets in star graphs
- The (n,k)-star graph: A generalized star graph
- Theory and Application of Graphs
Cited in
(8)- Fault-tolerance of (n, k)-star networks
- Maximum independent sets partition of \((n, k)\)-star graphs
- scientific article; zbMATH DE number 6403923 (Why is no real title available?)
- 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)