On the decycling number of generalized Kautz digraphs

DOI10.1016/J.IPL.2014.09.013MaRDI QIDQ477628zbMATH OpenOpenAlexFDO

Authors Min-Yun Lien, Jyhmin Kuo, 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

zbMATH Keywords

interconnection networksdecycling numberfeedback vertex numbergeneralized Kautz digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• New bounds on the decycling number of generalized de Bruijn digraphs
• On the number of cycles in generalized Kautz digraphs
• The decycling number of generalized Petersen graphs
• Feedback numbers of Kautz digraphs
• Feedback number of generalized Kautz digraphs \(\mathrm{GK}(2,n)\).

Cites work

• scientific article; zbMATH DE number 6118220 (Why is no real title available?)
• scientific article; zbMATH DE number 5711445 (Why is no real title available?)
• scientific article; zbMATH DE number 1305449 (Why is no real title available?)
• scientific article; zbMATH DE number 1744105 (Why is no real title available?)
• A Design for Directed Graphs with Minimum Diameter
• Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
• Bounds on feedback numbers of de Bruijn graphs
• Decycling graphs
• Decycling hypercubes
• Design to Minimize Diameter on Building-Block Network
• Feedback numbers of Kautz digraphs
• Feedback numbers of Kautz undirected graphs
• Feedback numbers of de Bruijn digraphs
• Feedback vertex set in hypercubes
• Feedback vertex sets and cyclically reducible graphs
• Feedback vertex sets in star graphs
• Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies
• Local majorities, coalitions and monopolies in graphs: A review
• Maximum induced trees in graphs
• Minimal feedback vertex sets in directed split‐stars
• On the feedback vertex set problem in permutation graphs
• Size bounds for dynamic monopolies

Cited in

(7)

• Arc fault tolerance of Kautz digraphs
• On the number of cycles in generalized Kautz digraphs
• Distance domination of generalized de Bruijn and Kautz digraphs
• The decycling number of generalized Petersen graphs
• New bounds on the decycling number of generalized de Bruijn digraphs
• Feedback numbers of Kautz digraphs
• Feedback arc number and feedback vertex number of Cartesian product of directed cycles

This page was built for publication: On the decycling number of generalized Kautz digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477628)