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
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}\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bau, S., Beineke, L.W.: The decycling number of graphs. Austral. J. Combinatorics 25, 285–298 (2002)
Chantasartrassmee, A., Punnim, N.: Constrained switchings in cubic graphs. Ars Combinatoria 81, 65–79 (2006)
Chartrand, G., Lesniak, L.: Graphs & Digraphs, 4th edn. Chapman & Hall/CRC, A CRC Press Company (2005)
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)
Havel, V.: A remark on the existence of finite graphs (Czech). Casopis Pest. Mat. 80, 477–480 (1955)
Punnim, N.: Decycling regular graphs. Austral. J. Combinatorics 32, 147–162 (2005)
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)
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)
Taylor, R.: Constrained switchings in graphs. In: Combinatorial Mathematics. VIII (Geelong, 1980). Lecture Notes in Math., vol. 884, pp. 314–336 (1981)
Taylor, R.: Switchings constrained to 2-connectivity in simple graphs. Siam J. Alg. Disc. Math. 3(1), 114–121 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chantasartrassmee, A., Punnim, N. (2011). Regular Graphs with Maximum Forest Number. In: Akiyama, J., Bo, J., Kano, M., Tan, X. (eds) Computational Geometry, Graphs and Applications. CGGA 2010. Lecture Notes in Computer Science, vol 7033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24983-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-24983-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24982-2
Online ISBN: 978-3-642-24983-9
eBook Packages: Computer ScienceComputer Science (R0)