The Interpolation Theorems for the Star Arboricity
Article Sidebar
Main Article Content
Abstract
The purpose of this research is to prove that the star arboricity is an interpolation graph parameter on the class of simple and connected graphs with m edges and n vertices. The result of this research shows that the star arboricity is an interpolation graph parameter on the class of simple and connected graphs with m edges and n vertices denoted by and
, respectively. As a result, for
and
, there exists a graph
with
for all . In the same way, for
and
there exists a graph
with
for all
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
- Content and information in articles published in NKRAFA Journal of Science and Technology are comment and responsibility of authors of articles directly. Journal editorial do no need to agree or share any responsibility.
- NKRAFA Journal of Science and Technology Articles holds the copyright of the content, pictures, images etc. which published in it. If any person or agency require to reuse all or some part of articles, the permission must be obtained from the NKRAFA Journal of Science and Technology.
References
G. Chartrand, “The theory and application of graphs,” in The Fourth International Conference on the Theory and Application of graphs, Western Michigan University, Kalamazoo, Michigan, May 6-8, 1980.
N. Punnim, “Degree Sequences and Chromatic Numbers of Graphs,” Graphs and Combinatorics, Vol. 18, no. 3, pp. 597-603, October 2002.
N. Punnim, “The Clique Numbers of Regular Graphs,” Graphs and Combinatorics, Vol. 18, no. 4, pp. 781-785, December 2002.
N. Punnim, “On Maximum Induced Forests in Graphs,” Southeast Asian Bulletin of Mathematics, Vol. 27, no. 4, pp. 667-674, October 2003.
N. Punnim, “The Matching Number of Regular Graphs,” Thai Journal of Mathematics. Vol. 2, no. 1, pp 133-140, January 2004.
N. Punnim, “Interpolation Theorems on Graph Parameters,” Southeast Asian Bulletin of Mathematics. Vol. 28, no. 3, pp. 533-538, January 2004.
N. Punnim, “Interpolation Theorems in Jump Graphs,” Australasian Journal of Combinatorics. Vol. 39, no. 1, pp. 103-111, January 2007.
A. Chaemchan, “Bounds on the Arboricities of Connected Graphs,” Australasian Journal of Combinatorics, Vol. 49, pp. 209-215, February 2011.
A. Chantasartrassmee and N. Punnim, “An Intermediate Value Theorem for the Arboricities,” International Journal of Mathematics and Mathematical Sciences. Vol. 2011, no. 1, pp. 1-7, June 2011.
J. A. Bondy and U. S. R. Murty, Graph theory with applications, London: Macmillan, 1976.
C. S. J. Nash-William, “Edge-disjoint Spanning Trees of Finite Graphs,” Journal of the London Mathematical Society, Vol. 1, no. 1, pp. 445-450, December 1961.