Skip to main content
SpringerLink
Log in

On potentially K 5-H-graphic sequences

  • Published:
Czechoslovak Mathematical Journal Aims and scope Submit manuscript

Abstract

Let K m -H be the graph obtained from K m by removing the edges set E(H) of H where H is a subgraph of K m . In this paper, we characterize the potentially K 5-P 4 and K 5-Y 4-graphic sequences where Y 4 is a tree on 5 vertices and 3 leaves.

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

Access this article

Log in via an institution

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. J. A. Bondy, U. S. R. Murty: Graph Theory with Applications. Macmillan Press, 1976.

  2. P. Erdös, M. S. Jacobson, J. Lehel: Graphs realizing the same degree sequences and their respective clique numbers. In: Graph Theory, Combinatorics and Application, Vol. 1 (Y. Alavi et al., eds.). John Wiley and Sons, New York, 1991, pp. 439–449.

    Google Scholar 

  3. R. J. Gould, M. S. Jacobson, J. Lehel: Potentially G-graphic degree sequences. Combinatorics, Graph Theory and Algorithms, Vol. 2 (Y. Alavi et al., eds.). New Issues Press, Kalamazoo, 1999, pp. 451–460.

    Google Scholar 

  4. G. Gupta, P. Joshi, A. Tripathi: Graphic sequences of trees and a problem of Frobenius. Czech. Math. J. 57 (2007), 49–52.

    Article  MathSciNet  Google Scholar 

  5. M. Ferrara, R. Gould, J. Schmitt: Potentially K t s -graphic degree sequences. Submitted.

  6. M. Ferrara, R. Gould, J. Schmitt: Graphic sequences with a realization containing a friendship graph. Ars Comb. Accepted.

  7. Lili Hu, Chunhui Lai: On potentially K 5-C 4-graphic sequences. Ars Comb. Accepted.

  8. Lili Hu, Chunhui Lai: On potentially K 5-Z 4-graphic sequences. Submitted.

  9. D. J. Kleitman, D. L. Wang: Algorithm for constructing graphs and digraphs with given valences and factors. Discrete Math. 6 (1973), 79–88.

    Article  MATH  MathSciNet  Google Scholar 

  10. Chunhui Lai: A note on potentially K 4-e graphical sequences. Australas J. Comb. 24 (2001), 123–127.

    MATH  Google Scholar 

  11. Chunhui Lai: An extremal problem on potentially K m -P k -graphic sequences. Int. J. Pure Appl. Math. Accepted.

  12. Chunhui Lai: An extremal problem on potentially K m -C 4-graphic sequences. J. Comb. Math. Comb. Comput. 61 (2007), 59–63.

    MATH  Google Scholar 

  13. Chunhui Lai: An extremal problem on potentially K p,1,1-graphic sequences. Discret. Math. Theor. Comput. Sci. 7 (2005), 75–80.

    MATH  Google Scholar 

  14. Chunhui Lai, Lili Hu: An extremal problem on potentially K r+1-H-graphic sequences. Ars Comb. Accepted.

  15. Chunhui Lai: The smallest degree sum that yields potentially K r+1-Z-graphical sequences. Ars Comb. Accepted.

  16. Jiong-Sheng Li, Zi-Xia Song: An extremal problem on the potentially P k -graphic sequences. In: Proc. International Symposium on Combinatorics and Applications, June 28–30, 1996 (W. Y. C. Chen et. al., eds.). Nankai University, Tianjin, 1996, pp. 269–276.

    Google Scholar 

  17. Jiong-Sheng Li, Zi-Xia Song: The smallest degree sum that yields potentially P k -graphical sequences. J. Graph Theory 29 (1998), 63–72.

    Article  MATH  MathSciNet  Google Scholar 

  18. Jiong-sheng Li, Zi-Xia Song, Rong Luo: The Erdös-Jacobson-Lehel conjecture on potentially P k -graphic sequence is true. Sci. China (Ser. A) 41 (1998), 510–520.

    Article  MATH  MathSciNet  Google Scholar 

  19. Jiong-sheng Li, Jianhua Yin: A variation of an extremal theorem due to Woodall. Southeast Asian Bull. Math. 25 (2001), 427–434.

    Article  MATH  MathSciNet  Google Scholar 

  20. R. Luo: On potentially C k -graphic sequences. Ars Comb. 64 (2002), 301–318.

    MATH  Google Scholar 

  21. R. Luo, M. Warner: On potentially K k -graphic sequences. Ars Combin. 75 (2005), 233–239.

    MATH  MathSciNet  Google Scholar 

  22. E. M. Eschen, J. Niu: On potentially K 4-e-graphic sequences. Australas J. Comb. 29 (2004), 59–65.

    MATH  MathSciNet  Google Scholar 

  23. J.-H. Yin, J. S. Li: Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size. Discrete Math. 301 (2005), 218–227.

    Article  MATH  MathSciNet  Google Scholar 

  24. J.-H. Yin, J.-S. Li, R. Mao: An extremal problem on the potentially K r+1-e-graphic sequences. Ars Comb. 74 (2005), 151–159.

    MathSciNet  Google Scholar 

  25. J.-H. Yin, G. Chen: On potentially \( K_{r_1 ,r_2 , \ldots ,r_m } \)-graphic sequences. Util. Math. 72 (2007), 149–161.

    MATH  MathSciNet  Google Scholar 

  26. M. Yin: The smallest degree sum that yields potentially K r+1-K 3-graphic sequences. Acta Math. Appl. Sin., Engl. Ser. 22 (2006), 451–456.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Zhangzhou Teachers College, Zhangzhou, 363000, P.R. China

    Lili Hu & Chunhui Lai

  2. Dept. of Math., Stats. and Computer Science, St. Francis Xavier University, Antigonish, NS, Canada, B2G 2W5

    Ping Wang

Authors
  1. Lili Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chunhui Lai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ping Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lili Hu.

Additional information

Research was supported by NNSF of China (10271105) and by NSF of Fujian (Z0511034), Fujian Provincial Training Foundation for “Bai-Quan-Wan Talents Engineering”, Project of Fujian Education Department, Project of Zhangzhou Teachers College and by NSERC.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hu, L., Lai, C. & Wang, P. On potentially K 5-H-graphic sequences. Czech Math J 59, 173–182 (2009). https://doi.org/10.1007/s10587-009-0012-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10587-009-0012-8

Keywords

MSC 2000

Search

Navigation