Publication:
The decycling number of cubic graphs

1
0

Issued Date

2005

Resource Type

Conference Paper

File Type

application/pdf

ISSN

3029743

DOI

10.1007/978-3-540-30540-8_16

Other identifier(s)

2-s2.0-23944515721

Rights Holder(s)

มหาวิทยาลัยศรีนครินทรวิโรฒ

Bibliographic Citation

Lecture Notes in Computer Science. Vol 3330, (2005), p.141-145

Suggested Citation

Punnim N. The decycling number of cubic graphs. Lecture Notes in Computer Science. Vol 3330, (2005), p.141-145. doi:10.1007/978-3-540-30540-8_16 Retrieved from: https://hdl.handle.net/20.500.14740/6186

Title

The decycling number of cubic graphs

Author(s)

Punnim N.

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.

Subject(s)

Combinatorial mathematics
 Computational geometry
 Computer science
 Edge detection
 Disjoint edges
 Graph drawing
 Jordan arcs
 Vertices
 Graph theory

View online Resources

Research Projects

Organizational Units

Journal Issue

URI

https://hdl.handle.net/20.500.14740/6186

Collections

Scopus: Year 1983-2021

Endorsement

Review

Supplemented By

Referenced By