Advertisement

Regular Graphs with Maximum Forest Number

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

Abstract

Punnim proved in [6] that if G is an r-regular graph of order n, then its forest number is at most c, where

$$c=\left\{ \begin{array} {ll} n-r+1 & {\rm if} \; r+1 \leq n \leq 2r-1,\\ \lfloor \frac{nr-2}{2(r-1)} \rfloor & {\rm if}\; n\geq 2r. \end{array} \right.$$

He also proved that the bound is sharp. Let \({\cal{R}}(r^{n};c)\) be the class of all r-regular graphs of order n. We prove in this paper that if \(G, H\in{\cal{R}}(r^{n};c)\), then there exists a sequence of switchings σ 1, σ 2, …, σ t such that for each i = 1, 2, …, t, \(G^{\sigma_1\sigma_2\cdots\sigma_i}\in{\cal{R}}(r^n;c)\) and \(H=G^{\sigma_1\sigma_2\cdots\sigma_t}\).

Keywords

Planar Graph Nonnegative Integer Regular Graph Degree Sequence Graphical Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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. Austral. J. Combinatorics 25, 285–298 (2002)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Chantasartrassmee, A., Punnim, N.: Constrained switchings in cubic graphs. Ars Combinatoria 81, 65–79 (2006)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Chartrand, G., Lesniak, L.: Graphs & Digraphs, 4th edn. Chapman & Hall/CRC, A CRC Press Company (2005)Google Scholar
  4. 4.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Havel, V.: A remark on the existence of finite graphs (Czech). Casopis Pest. Mat. 80, 477–480 (1955)zbMATHGoogle Scholar
  6. 6.
    Punnim, N.: Decycling regular graphs. Austral. J. Combinatorics 32, 147–162 (2005)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Punnim, N.: The decycling number of cubic graphs. In: Akiyama, J., Baskoro, E.T., Kano, M. (eds.) IJCCGGT 2003. LNCS, vol. 3330, pp. 141–145. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Punnim, N.: The decycling number of cubic planar graphs. In: Akiyama, J., Chen, W.Y.C., Kano, M., Li, X., Yu, Q. (eds.) CJCDGCGT 2005. LNCS, vol. 4381, pp. 149–161. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Taylor, R.: Constrained switchings in graphs. In: Combinatorial Mathematics. VIII (Geelong, 1980). Lecture Notes in Math., vol. 884, pp. 314–336 (1981)Google Scholar
  10. 10.
    Taylor, R.: Switchings constrained to 2-connectivity in simple graphs. Siam J. Alg. Disc. Math. 3(1), 114–121 (1982)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Avapa Chantasartrassmee
    • 1
  • Narong Punnim
    • 2
  1. 1.University of the Thai Chamber of CommerceBangkokThailand
  2. 2.Srinakharinwirot UniversityBangkok

Personalised recommendations