首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On the ascending star subgraph decomposition of star forests
Authors:Kejie Ma  Huishan Zhou  Jianqin Zhou
Institution:(1) Institute of Operations Research, Qufu Normal University, Qufu, Shandong, People's Republic of China;(2) Department of Mathematics and Computer Science, Georgia State University, 30303-3083 Atlanta, Georgia, USA;(3) Institute of Operations Research, Qufu Normal University, Qufu, Shandong, People's Republic of China;(4) Department of Mathematics, Qufu Normal University, Qufu, Shandong, People's Republic of China
Abstract:LetG be a graph of size 
$$\left( {n_2^ +  1} \right)$$
for some integernge2. ThenG is said to have an ascending star subgraph decomposition ifG can be decomposed inton subgraphsG 1,G 2, ...,G n such that eachG i is a star of sizei with 1leilen. We shall prove in this paper that a star forest with size 
$$\left( {n_2^ +  1} \right)$$
, possesses an ascending star subgraph decomposition if the size of each component is at leastn, which is stronger than the conjecture proposed by Y. Alavi, A. J. Boals, G. Chartrand, P. Erdodblacs and O. R. Oellermann.
Keywords:05 C 70  11 A 99  90 C 35  68 R 10
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号