Publication:
The decycling number of cubic graphs

Simple item page
dc.contributor.authorPunnim N.
dc.date.accessioned2021-04-05T04:32:39Z
dc.date.available2021-04-05T04:32:39Z
dc.date.issued2005
dc.date.issuedBE2548
dc.description.abstractFor 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.
dc.format.mimetypeapplication/pdf
dc.identifier.citationLecture Notes in Computer Science. Vol 3330, (2005), p.141-145
dc.identifier.doi10.1007/978-3-540-30540-8_16
dc.identifier.issn3029743
dc.identifier.other2-s2.0-23944515721
dc.identifier.urihttps://swu-dspace2.eval.plus/handle/123456789/6186
dc.rights.holderScopus
dc.subject.otherCombinatorial mathematics
dc.subject.otherComputational geometry
dc.subject.otherComputer science
dc.subject.otherEdge detection
dc.subject.otherDisjoint edges
dc.subject.otherGraph drawing
dc.subject.otherJordan arcs
dc.subject.otherVertices
dc.subject.otherGraph theory
dc.titleThe decycling number of cubic graphs
dc.typeConference Paper
dspace.entity.typePublication
swu.datasource.scopushttps://www.scopus.com/inward/record.uri?eid=2-s2.0-23944515721&doi=10.1007%2f978-3-540-30540-8_16&partnerID=40&md5=7450f067eb0c617c29f4bb5f28f26c01

Files

Collections

Scopus: Year 1983-2021