For a graph G, a subset S ⊆ V(G), is said to be a decycling set of G if if G \S is acyclic. The cardinality of smallest decycling set of G is called the decycling number of G and it is denoted by φ(G). Bau and Beineke posed the following problems: Which cubic graphs G with |G |= 2n satisfy φ(G) = [n+1/2]? In this paper, we give an answer to this problem. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Punnim, N. (2005). The decycling number of cubic graphs. In Lecture Notes in Computer Science (Vol. 3330, pp. 141–145). Springer Verlag. https://doi.org/10.1007/978-3-540-30540-8_16
Mendeley helps you to discover research relevant for your work.