DECYCLING GRAPHS

Citation
Lw. Beineke et Rc. Vandell, DECYCLING GRAPHS, Journal of graph theory, 25(1), 1997, pp. 59-77
Citations number
6
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
ISSN journal
03649024
Volume
25
Issue
1
Year of publication
1997
Pages
59 - 77
Database
ISI
SICI code
0364-9024(1997)25:1<59:DG>2.0.ZU;2-C
Abstract
In this paper, we introduce the decycling number of a graph as the min imum 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.