Please use this identifier to cite or link to this item: https://ir.swu.ac.th/jspui/handle/123456789/15105
Title: The decycling number of cubic graphs
Authors: Punnim N.
Keywords: Combinatorial mathematics
Computational geometry
Computer science
Edge detection
Disjoint edges
Graph drawing
Jordan arcs
Vertices
Graph theory
Issue Date: 2005
Abstract: 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.
URI: https://ir.swu.ac.th/jspui/handle/123456789/15105
https://www.scopus.com/inward/record.uri?eid=2-s2.0-23944515721&doi=10.1007%2f978-3-540-30540-8_16&partnerID=40&md5=7450f067eb0c617c29f4bb5f28f26c01
ISSN: 3029743
Appears in Collections:Scopus 1983-2021

Files in This Item:
There are no files associated with this item.


Items in SWU repository are protected by copyright, with all rights reserved, unless otherwise indicated.