Regular graphs with maximum forest number

Thumbnail Image
File(s)
Author(s)
Other Contributor(s)
University of the Thai Chamber of Commerce. Research Support Office
Publisher(s)
University of the Thai Chamber of Commerce
Date Issued
2011
Resource Type
Text::Conference output::Conference proceedings::Conference paper
Language
English
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.
Subject(s)
Conference
Access Rights
public
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.
Rights Holder
University of the Thai Chamber of Commerce
Bibliographic Citation
A. Chantasartrassmee, N. Punnim (2011) Regular graphs with maximum forest number., 12-18.
URI