Feedback numbers of de Bruijn digraphs

DOI10.1016/J.CAMWA.2009.10.021zbMATH Open1189.05166OpenAlexW1975145864MaRDI QIDQ980262FDOQ980262

Authors: Xirong Xu, Yongchang Cao, Jun-Ming Xu, Yezhou Wu 

Publication date: 28 June 2010

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2009.10.021

Recommendations

• scientific article
• Bounds on feedback numbers of de Bruijn graphs
• Feedback numbers of Kautz digraphs
• New bounds on the decycling number of generalized de Bruijn digraphs
• Feedback number of generalized Kautz digraphs \(\mathrm{GK}(2,n)\).

zbMATH Keywords

cyclesfeedback vertex setacyclic subgraphfeedback numberde Bruijn digraphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
• Title not available (Why is that?)
• On the feedback vertex set problem in permutation graphs
• Maximum induced trees in graphs
• Almost exact minimum feedback vertex set in meshes and butterflies
• Feedback vertex set in hypercubes
• Feedback vertex sets and cyclically reducible graphs
• Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
• Decycling graphs
• Minimum feedback vertex sets in shuffle-based interconnection networks
• Title not available (Why is that?)
• Minimal feedback vertex sets in directed split‐stars
• Feedback numbers of Kautz digraphs
• The Lattice Point Covering Theorem for Rectangles
• Decycling cubes and grids
• De Bruijn and Kautz digraphs of a rooted tree

Cited In (10)

• The decycling number of \(P_m\square P^\ast_n\)
• Bounds on feedback numbers of de Bruijn graphs
• Title not available (Why is that?)
• Feedback numbers of Kautz undirected graphs
• New bounds on the decycling number of generalized de Bruijn digraphs
• On the decycling number of generalized Kautz digraphs
• Feedback numbers of Kautz digraphs
• Feedback functions for generating cycles over a finite alphabet
• Bounds for minimum feedback vertex sets in distance graphs and circulant graphs
• Feedback vertex number of Sierpiński-type graphs

This page was built for publication: Feedback numbers of de Bruijn digraphs

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