Publication:
Regular graphs with maximum forest number

2
0

Issued Date

2011

Resource Type

Conference Paper

File Type

application/pdf

ISSN

3029743

DOI

10.1007/978-3-642-24983-9_2

Other identifier(s)

2-s2.0-81255124124

Rights Holder(s)

Scopus

Bibliographic Citation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 7033 LNCS, No. (2011), p.12-18

Suggested Citation

Chantasartrassmee A., Punnim N. Regular graphs with maximum forest number. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 7033 LNCS, No. (2011), p.12-18. doi:10.1007/978-3-642-24983-9_2 Retrieved from: https://hdl.handle.net/20.500.14740/7215

Title

Regular graphs with maximum forest number

Author(s)

Chantasartrassmee A.
 Punnim N.

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 (Equation Presented) He also proved that the bound is sharp. Let R(rn; c) be the class of all r-regular 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. © 2011 Springer-Verlag.

Subject(s)

Regular graphs
 Computational geometry
 Forestry
 Graph theory
 Graphic methods
 Forestry
 Geometry
 Graphic Methods
 Optimization

View online Resources

Research Projects

Organizational Units

Journal Issue

URI

https://hdl.handle.net/20.500.14740/7215

Collections

Scopus: Year 1983-2021

Endorsement

Review

Supplemented By

Referenced By