Advertisement

The Decycling Number of Cubic Graphs

  • Narong Punnim
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3330)

Abstract

For a graph G, a subset SV(G), is said to be a decycling set of G if if GS 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 \(\phi(G)=\lceil{\frac{n+1}{2}}\rceil\)? In this paper, we give an answer to this problem.

Keywords

Degree sequence decycling number cubic graph 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bau, S., Beineke, L.W.: The decycling number of graphs. Australasian J. Combinatorics 25, 285–298 (2002)zbMATHMathSciNetGoogle Scholar
  2. 2.
    Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, 1st edn. The MacMillan Press, Basingstoke (1976)Google Scholar
  3. 3.
    Hakimi, S.: On the realizability of a set of integers as the degree of the vertices of a graph. SIAM J. Appl. Math. 10, 496–506 (1962)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Havel, M.: A remark on the existence of finite graphs (in Hungarian). Casopis Pest. Mat. 80, 477–480 (1955)zbMATHMathSciNetGoogle Scholar
  5. 5.
    Punnim, N.: On maximum induced forests in graphs. Seams Bull. of Maths. 27, 667–674 (2003)zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Narong Punnim
    • 1
  1. 1.Department of MathematicsSrinakharinwirot UniversityBangkokThailand

Personalised recommendations