Current position: Home >> Scientific Research >> Paper Publications

The decycling number of generalized Petersen graphs

Release Time:2019-03-09  Hits:

Indexed by: Journal Article

Date of Publication: 2015-01-30

Journal: DISCRETE APPLIED MATHEMATICS

Included Journals: Scopus、EI、SCIE

Volume: 181

Page Number: 297-300

ISSN: 0166-218X

Key Words: Graph theory; Decycling set; Decycling number; Generalized Petersen graphs; Cycles; Acyclic subgraph

Abstract: A subset F subset of V(G) is called a decycling set if the subgraph G - F is acyclic. The minimum cardinality of a decycling set is called the decycling number of G, which is proposed first by Beineke and Vandell (1997). We use del(P-n,P-k) to denote the decycling number of the generalized Petersen graphs Ploc. This paper proves that
   [GRAPHICS]
   ,
   (C) 2014 Elsevier B.V. All rights reserved.

Prev One:Feedback Numbers of Augmented Cubes AQ(n)

Next One:Improved feedback vertex sets in Kautz digraphs K (d, n)