On the decycling number of generalized Kautz digraphs
From MaRDI portal
Publication:477628
DOI10.1016/j.ipl.2014.09.013zbMath1304.05062OpenAlexW2063612829MaRDI QIDQ477628
Jyhmin Kuo, Min-Yun Lien, Hung-Lin Fu
Publication date: 9 December 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.013
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
New bounds on the decycling number of generalized de Bruijn digraphs ⋮ Distance domination of generalized de Bruijn and Kautz digraphs ⋮ Feedback arc number and feedback vertex number of Cartesian product of directed cycles ⋮ Arc fault tolerance of Kautz digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Feedback vertex set in hypercubes
- Bounds on feedback numbers of de Bruijn graphs
- Feedback numbers of Kautz digraphs
- Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies
- Feedback numbers of de Bruijn digraphs
- Feedback vertex sets in star graphs
- Maximum induced trees in graphs
- Size bounds for dynamic monopolies
- On the feedback vertex set problem in permutation graphs
- Decycling hypercubes
- Local majorities, coalitions and monopolies in graphs: A review
- A Design for Directed Graphs with Minimum Diameter
- Feedback vertex sets and cyclically reducible graphs
- Design to Minimize Diameter on Building-Block Network
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Decycling graphs
- Minimal feedback vertex sets in directed split‐stars
This page was built for publication: On the decycling number of generalized Kautz digraphs
