Decycling cubes and grids
From MaRDI portal
The decycling number of a graph \(G\) is the smallest size of a decycling set, that is, a vertex set whose deletion removes all cycles from \(G\). The authors give some improvements on lower and upper bounds for the decycling numbers of \(n\)-cubes and grid graphs obtained by Beineke-Vandell in 1997; see \textit{L. W. Beineke} and \textit{R. C. Vandell} [J. Graph Theory 25, No. 1, 59-77 (1997; Zbl 0870.05033)]. The new bounds are determined by finding decycling sets of key subgraphs of these graphs.
Recommendations
Cited in
(22)- Minimum feedback vertex sets in shuffle-based interconnection networks
- Decycling hypercubes
- The integrity of a cubic graph
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles
- Decycling the Cartesian product of a bipartite graph with K₂
- Decycling squares of trees
- Decycling powers of paths and of cycles
- Decycling graphs
- scientific article; zbMATH DE number 1026076 (Why is no real title available?)
- scientific article; zbMATH DE number 1472114 (Why is no real title available?)
- scientific article; zbMATH DE number 1744105 (Why is no real title available?)
- New bounds on the decycling number of generalized de Bruijn digraphs
- Cycle intersection graphs and minimum decycling sets of even graphs
- Decycling bipartite graphs
- Decycling \(d\)-ary \(n\)-dimensional cubes
- Decycling Cartesian Products of Two Cycles
- Decycling of Fibonacci cubes
- scientific article; zbMATH DE number 2230267 (Why is no real title available?)
- Induced forests in some distance-regular graphs
- On decycling and forest numbers of Cartesian products of trees
- Feedback numbers of Kautz digraphs
- Feedback numbers of de Bruijn digraphs
This page was built for publication: Decycling cubes and grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2725019)
