Please use this identifier to cite or link to this item:
Title: Regular graphs with maximum forest number
Authors: Chantasartrassmee, A. 
Punnim, N. 
Issue Date: 2011
Publisher: University of the Thai Chamber of Commerce
Source: A. Chantasartrassmee, N. Punnim (2011) Regular graphs with maximum forest number., 12-18.
Conference: (2011) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 
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.
Rights: This work is protected by copyright. Reproduction or distribution of the work in any format is prohibited without written permission of the copyright owner.
Appears in Collections:RSO: Conference Papers

Files in This Item:
File Description SizeFormat 
139.pdf149.31 kBAdobe PDFThumbnail
Show full item record Recommend this item

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.