New bounds on the decycling number of generalized de Bruijn digraphs

DOI10.1142/S1793830917500628zbMath1386.05076OpenAlexW2742433942MaRDI QIDQ4595251

Jyhmin Kuo, Hung-Lin Fu

Publication date: 29 November 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830917500628

zbMATH Keywords

necklacesdecycling numberfeedback numbergeneralized de Bruijn digraphconstrained necklaces

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Feedback vertex set in hypercubes
• On the decycling number of generalized Kautz digraphs
• 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
• Counting closed walks in generalized de Bruijn graphs
• On the feedback vertex set problem in permutation graphs
• Decycling hypercubes
• Local majorities, coalitions and monopolies in graphs: A review
• Wavelength Conversion in Optical Networks
• 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: New bounds on the decycling number of generalized de Bruijn digraphs