Bounds on feedback numbers of de Bruijn graphs

DOI10.11650/TWJM/1500406287MaRDI QIDQ652096zbMATH OpenOpenAlexFDO

Authors Xirong Xu, Jun-Ming Xu, Yongchang Cao

Publication date 19 December 2011

Published in Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.11650/twjm/1500406287

zbMATH Keywords

acyclic subgraph

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Feedback numbers of de Bruijn digraphs
• Bounding the feedback vertex number of digraphs in terms of vertex degrees
• scientific article; zbMATH DE number 5711445
• Feedback numbers of Kautz undirected graphs
• scientific article; zbMATH DE number 609926
• On the bounds of feedback numbers of \((n,k)\)-star graphs
• New bounds on the decycling number of generalized de Bruijn digraphs
• A new upper bound for the isoperimetric number of de Bruijn networks
• scientific article; zbMATH DE number 2075779
• Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth

Cited in

(8)

• Feedback numbers of Kautz undirected graphs
• Feedback vertex number of Sierpiński-type graphs
• scientific article; zbMATH DE number 5711445 (Why is no real title available?)
• On the bounds of feedback numbers of \((n,k)\)-star graphs
• New bounds on the decycling number of generalized de Bruijn digraphs
• On the decycling number of generalized Kautz digraphs
• Bounding the feedback vertex number of digraphs in terms of vertex degrees
• Feedback numbers of de Bruijn digraphs

This page was built for publication: Bounds on feedback numbers of de Bruijn graphs

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