Optimal Routing Algorithms for Generalized de Bruijn Digraphs

1993 ◽  
Author(s):  
Guoping Liu ◽  
Kyungsook Y Lee
Keyword(s):  
Routing Algorithms ◽  
Optimal Routing ◽  
De Bruijn ◽  
De Bruijn Digraphs

Broadcasting in Generalized de Bruijn Digraphs

2002 ◽  
pp. 200-209 ◽  
Author(s):  
Yosuke Kikuchi ◽  
Shingo Osawa ◽  
Yukio Shibata
Keyword(s):  
De Bruijn ◽  
De Bruijn Digraphs

Factorization of de Bruijn digraphs by cycle-rooted trees

2001 ◽  
Vol 77 (5-6) ◽  
pp. 269-275 ◽  
Author(s):  
Hiroyuki Kawai ◽  
Naohiro Fujikake ◽  
Yukio Shibata
Keyword(s):  
Rooted Trees ◽  
De Bruijn ◽  
De Bruijn Digraphs

Generalized de Bruijn digraphs

Networks ◽  
1988 ◽  
Vol 18 (1) ◽  
pp. 27-38 ◽  
Author(s):  
D. Z. Du ◽  
F. K. Hwang
Keyword(s):  
De Bruijn ◽  
De Bruijn Digraphs

New bounds on the decycling number of generalized de Bruijn digraphs

2017 ◽  
Vol 09 (05) ◽  
pp. 1750062
Author(s):  
Jyhmin Kuo ◽  
Hung-Lin Fu
Keyword(s):  
Feedback Vertex Set ◽  
Systematic Method ◽  
Minimum Cardinality ◽  
Disjoint Cycles ◽  
Decycling Number ◽  
Vertex Set ◽  
De Bruijn ◽  
De Bruijn Digraphs ◽  
Vertex Disjoint ◽  
De Bruijn Digraph

A set of vertices of a graph whose removal leaves an acyclic graph is referred as a decycling set, or a feedback vertex set, of the graph. The minimum cardinality of a decycling set of a graph [Formula: see text] is referred to as the decycling number of [Formula: see text]. For [Formula: see text], the generalized de Bruijn digraph [Formula: see text] is defined by congruence equations as follows: [Formula: see text] and [Formula: see text]. In this paper, we give a systematic method to find a decycling set of [Formula: see text] and give a new upper bound that improve the best known results. By counting the number of vertex-disjoint cycles with the idea of constrained necklaces, we obtain new lower bounds on the decycling number of generalized de Bruijn digraphs.

scholarly journals De Bruijn digraphs and affine transformations

2005 ◽  
Vol 26 (8) ◽  
pp. 1191-1206 ◽  
Author(s):  
Aiping Deng ◽  
Yaokun Wu
Keyword(s):  
Affine Transformations ◽  
De Bruijn ◽  
De Bruijn Digraphs
Sign in / Sign up

Export Citation Format

Share Document