Skip to main content
Springer Nature Link
Log in

On the ascending star subgraph decomposition of star forests

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

LetG be a graph of size\(\left( {n_2^ + 1} \right)\) for some integern≥2. 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 1≤i≤n. 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. Erdős and O. R. Oellermann.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Y. Alavi, A. J. Boals, G. Chartrand, P. Erdős, andO. R. Oellermann: The ascending subgraph decomposition problem,Congressus Numerantium 58 (1987), 7–14.

    Google Scholar 

  2. G. Chartrand, andL. Lesniak:Graphs and Digraphs, 2nd edition, Wadsworth and Brooks/Cole, Monterey, CA (1986).

    Google Scholar 

  3. H. Chen, andK. Ma: On a new subgraph decomposition problem,Utilitas Mathematica 37 (1990), 265–270.

    Google Scholar 

  4. H. Chen, K. Ma, andH. Zhou: The ascending star subgraph decomposition of star forests, accepted by Ars Combinatoria, to appear.

  5. R. J. Faudree, A. Gyárfás, andR. H. Schelp: Graphs which have an ascending subgraph decomposition,Congressus Numerantium 59 (1987), 49–54.

    Google Scholar 

  6. H. Fu: A note on the ascending subgraph decomposition,Discrete Mathematics to appear.

  7. H. Fu: Some results on ascending subgraph decomposition,Bulletin of the Institute of mathematics Academia Sinica,16 (1988) (4), 315–319.

    Google Scholar 

  8. A. Gyárfás, andJ. Lehel: Packing trees of different order intoK n, Colloquia Mathematica Societatis János Bolyai 18,Combinatorics Keszthely, Hungary, 1976, 463–469.

  9. F. Zhao On a new subgraph decomposition problem,Qufu Shifan Daxue Xuebao,14 (1988) (4) 58–61.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Operations Research, Qufu Normal University, Qufu, Shandong, People's Republic of China

    Kejie Ma

  2. Department of Mathematics and Computer Science, Georgia State University, 30303-3083, Atlanta, Georgia, USA

    Huishan Zhou

  3. Institute of Operations Research, Qufu Normal University, Qufu, Shandong, People's Republic of China

    Huishan Zhou

  4. Department of Mathematics, Qufu Normal University, Qufu, Shandong, People's Republic of China

    Jianqin Zhou

Authors
  1. Kejie Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huishan Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianqin Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ma, K., Zhou, H. & Zhou, J. On the ascending star subgraph decomposition of star forests. Combinatorica 14, 307–320 (1994). https://doi.org/10.1007/BF01212979

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01212979

AMS subject classification code (1991)