Decycling graphs

被引：2
|
作者：
Beineke, LW [1 ]
Vandell, RC [1 ]
机构：
[1] WESTERN MICHIGAN UNIV,KALAMAZOO,MI 49008
来源：
JOURNAL OF GRAPH THEORY | 1997年 / 25卷 / 01期
关键词：
cycle; forest; grid; hypercube;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, we introduce the decycling number of a graph as the minimum number of vertices that must be removed in order to eliminate all cycles. After proving some general results, we focus on two families of graph products, the grids and the hypercubes. (C) 1997 John Wiley & Sons, Inc.
引用
收藏
页码：59 / 77
页数：19
相关论文
共 50 条
  • [31] Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs
    Protti, Fabio
    Souza, Ueverton S.
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2018, 20 (02):
  • [32] Subgraph-avoiding minimum decycling sets and k-conversion sets in graphs
    Francis, M. D.
    Mynhardt, C. M.
    Wodlinger, J. L.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2019, 74 : 288 - 304
  • [33] Decycling of Fibonacci cubes
    Ellis-Monaghan, Joanna A.
    Pike, David A.
    Zout, Yubo
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2006, 35 : 31 - 40
  • [34] Prospects for a Theory of Decycling
    Litland, Jon Erling
    NOTRE DAME JOURNAL OF FORMAL LOGIC, 2020, 61 (03) : 467 - 499
  • [35] Decycling cubes and grids
    Bau, S
    Beineke, LW
    Du, GM
    Liu, ZS
    Vandell, RC
    UTILITAS MATHEMATICA, 2001, 59 : 129 - 137
  • [36] ON THE DECYCLING PROBLEM IN HIERARCHICAL HYPERCUBES
    Bossard, Antoine
    JOURNAL OF INTERCONNECTION NETWORKS, 2013, 14 (02)
  • [37] The decycling number of a line graph
    Ma, Mingyuan
    Ren, Han
    DISCRETE MATHEMATICS, 2025, 348 (02)
  • [38] On Solving the Decycling Problem in a Torus Network
    Bossard, Antoine
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2021, 2021
  • [39] Fast and simple decycling and dismantling of networks
    Lenka Zdeborová
    Pan Zhang
    Hai-Jun Zhou
    Scientific Reports, 6
  • [40] On the decycling number of generalized Kautz digraphs
    Lien, Min-Yun
    Kuo, Jyhmin
    Fu, Hung-Lin
    INFORMATION PROCESSING LETTERS, 2015, 115 (02) : 209 - 211
12345