BOUNDS ON FEEDBACK NUMBERS OF DE BRUIJN GRAPHS

被引:9
|
作者
Xu, Xirong [1 ,2 ]
Xu, Jun-Ming [2 ]
Cao, Yongchang [2 ]
机构
[1] Dalian Univ Technol, Dept Comp Sci, Dalian 116024, Peoples R China
[2] Univ Sci & Technol China, Dept Math, Hefei 230026, Anhui, Peoples R China
来源
TAIWANESE JOURNAL OF MATHEMATICS | 2011年 / 15卷 / 03期
关键词
Graph theory; Feedback vertex set; Feedback number; de Bruijn graphs; Cycles; Scyclic subgraph; Networks; VERTEX SET PROBLEM;
D O I
10.11650/twjm/1500406287
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The feedback number of a graph G is the minimum number of vertices whose removal from G results in an acyclic subgraph. We use f(d, n) to denote the feedback number of the de Bruijn graph UB(d, n). R. Kralovic and P. Ruzicka [Minimum feedback vertex sets in shuffle-based interconnection networks. Information Processing Letters, 86 (4) (2003), 191-196] proved that f (2, n) = [2(n)-2/3]. This paper gives the upper bound on f(d, n) for d >= 3, that is, f (d, n) <= d(n) (1 - (d/1+d)(d-1)) + ((n+d-2)(d-2)).
引用
收藏
页码:1101 / 1113
页数:13
相关论文
共 50 条
  • [41] On the diameter of a class of the generalized de Bruijn graphs
    Caro, JDL
    Zeratsion, TW
    I-SPAN'02: INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND NETWORKS, PROCEEDINGS, 2002, : 225 - 230
  • [42] On the Diameter of the Generalized Undirected De Bruijn Graphs
    Kuo, Jyhmin
    Fu, Hung-Lin
    ARS COMBINATORIA, 2012, 106 : 395 - 408
  • [43] Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs
    Egidi, Lavinia
    Louza, Felipe A.
    Manzini, Giovanni
    ALGORITHMICA, 2022, 84 (03) : 639 - 669
  • [44] LIGHTWAVE NETWORKS BASED ON DE BRUIJN GRAPHS
    SIVARAJAN, KN
    RAMASWAMI, R
    IEEE-ACM TRANSACTIONS ON NETWORKING, 1994, 2 (01) : 70 - 79
  • [45] On the recognition of de Bruijn graphs and their induced subgraphs
    Blazewicz, J
    Formanowicz, P
    Kasprzak, M
    Kobler, D
    DISCRETE MATHEMATICS, 2002, 245 (1-3) : 81 - 92
  • [46] 2-Diameter of de Bruijn graphs
    Li, Q
    Sotteau, D
    Xu, JM
    NETWORKS, 1996, 28 (01) : 7 - 14
  • [47] Variable-Order de Bruijn Graphs
    Boucher, Christina
    Bowe, Alex
    Gagie, Travis
    Puglisi, Simon J.
    Sadakane, Kunihiko
    2015 DATA COMPRESSION CONFERENCE (DCC), 2015, : 383 - 392
  • [48] Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs
    Lavinia Egidi
    Felipe A. Louza
    Giovanni Manzini
    Algorithmica, 2022, 84 : 639 - 669
  • [49] Aligning optical maps to de Bruijn graphs
    Mukherjee, Kingshuk
    Alipanahi, Bahar
    Kahveci, Tamer
    Salmela, Leena
    Boucher, Christina
    BIOINFORMATICS, 2019, 35 (18) : 3250 - 3256
  • [50] DNA Assembly with de Bruijn Graphs on FPGA
    Poirier, Carl
    Gosselin, Benoit
    Fortier, Paul
    2015 37TH ANNUAL INTERNATIONAL CONFERENCE OF THE IEEE ENGINEERING IN MEDICINE AND BIOLOGY SOCIETY (EMBC), 2015, : 6489 - 6492