Chantasartrassmee, A. and Punnim, N. (2011) Regular graphs with maximum forest number. In: (2011) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).

Text
139.pdf Download (152kB)  Preview 
Abstract
Punnim proved in [6] that if G is an rregular graph of order n, then its forest number is at most c, where (Equation Presented) He also proved that the bound is sharp. Let R(rn; c) be the class of all rregular graphs of order n. We prove in this paper that if G, H ∈ R(rn; c), then there exists a sequence of switchings σ1, σ2,. .., σt such that for each i=1, 2,...,t, and G σ1σ2...σi ∈ R(rn; c) and H = G σ1σ2...σt.
Item Type:  Conference or Workshop Item (Lecture) 

Subjects:  Science and Technology > Computer Science 
Divisions:  Research Center > Research Support Office 
Depositing User:  Miss Niramol Sudkhanung 
Date Deposited:  19 Oct 2016 04:30 
Last Modified:  19 Oct 2016 04:30 
URI:  http://eprints.utcc.ac.th/id/eprint/5751 
Actions (login required)
View Item 