Skip to main content
SpringerLink
Log in

A characterization for a sequence to be potentially K r+1 − e-graphic

  • Published:
Acta Mathematicae Applicatae Sinica, English Series Aims and scope Submit manuscript

Abstract

Let n ≥ r, let π = (d 1, d 2, ..., d n ) be a non-increasing sequence of nonnegative integers and let K r+1 − e be the graph obtained from K r+1 by deleting one edge. If π has a realization G containing K r+1 − e as a subgraph, then π is said to be potentially K r+1 − e-graphic. In this paper, we give a characterization for a sequence π to be potentially K r+1 − e-graphic.

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. Erdős, P., Gallai, T. Graphs with prescribed degrees of vertices. Mat. Lapok, 11: 264–274 (1960) (Hungarian)

    Google Scholar 

  2. Eschen, E., Niu, J.B. On potentially K 4 − e-graphic sequences. Australas. J. Combin., 29: 59–65 (2004)

    MathSciNet  MATH  Google Scholar 

  3. Fulkerson, D.R., Hoffman, A.J., McAndrew, M.H. Some properties of graphs with multiple edges. Canad. J. Math., 17: 166–177 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gould, R.J., Jacobson, M.S., Lehel, J. Potentially G-graphical degree sequences. In: Y. Alavi et al. (Eds.), Combinatorics, Graph Theory and Algorithms, Vol.1, New Issues Press, Kalamazoo Michigan, 1999, 451–460

    Google Scholar 

  5. Kézdy, A.E., Lehel, J. Degree sequences of graphs with prescribed clique size. In: Y. Alavi et al. (Eds.), Combinatorics, Graph Theory and Algorithms, Vol.2, New Issues Press, Kalamazoo Michigan, 1999, 535–544

    Google Scholar 

  6. Lai, C.H. Characterize the potentially K 4 − e-graphical sequences. J. Zhangzhou Teachers College, 15: 53–59 (2002)

    MATH  Google Scholar 

  7. Rao, A.R. The clique number of a graph with given degree sequence. In: Proc. Symposium on Graph Theory, A.R. Rao ed., MacMillan and Co. India Ltd., I.S.I. Lecture Notes Series, 4: 251–267 (1979)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Yin, M.X., Yin, J.H. On potentially H-graphic sequences. Czechoslovak Math. J., 57: 705–724 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, College of Information Science and Technology, Hainan University, Haikou, 570228, China

    Jian-hua Yin & Ye Wang

Authors
  1. Jian-hua Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ye Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jian-hua Yin.

Additional information

Supported by National Natural Science Foundation of China (Nos. 11161016 and 10861006).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yin, Jh., Wang, Y. A characterization for a sequence to be potentially K r+1 − e-graphic. Acta Math. Appl. Sin. Engl. Ser. 29, 787–792 (2013). https://doi.org/10.1007/s10255-013-0243-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-013-0243-1

Keywords

2000 MR Subject Classification

Search

Navigation