Advertisement

Czechoslovak Mathematical Journal

, Volume 57, Issue 2, pp 705–724 | Cite as

On potentially H-graphic sequences

  • Meng-Xiao Yin
  • Jian-Hua Yin
Article

Abstract

For given a graph H, a graphic sequence π = (d 1, d 2,..., d n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K 5e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to be potentially K 5-graphic, where K r is a complete graph on r vertices and K r-e is a graph obtained from K r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence π to be potentially K 6-graphic.

Keywords

graph degree sequence potentially H-graphic sequence 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    P. Erdős, M. S. Jacobson and J. Lehel: Graphs realizing the same degree sequences and their respective clique numbers, in: Y. Alavi et al., (Eds.). Graph Theory, Combinatorics and Applications, Vol. 1, John Wiley & Sons, New York, 1991, pp. 439–449.Google Scholar
  2. [2]
    Elaine Eschen and J. B. Niu: On potentially K 4-e-graphic. Australasian J. Combinatorics 29 (2004), 59–65.MATHMathSciNetGoogle Scholar
  3. [3]
    R. J. Gould, M. S. Jacobson and J. Lehel: Potentially G-graphical degree sequences, in: Y. Alavi et al., (Eds.). Combinatorics, Graph Theory, and Algorithms, Vol. 1, New Issues Press, Kalamazoo Michigan, 1999, pp. 451–460.Google Scholar
  4. [4]
    A. E. Kézdy and J. Lehel: 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, pp. 535–544.Google Scholar
  5. [5]
    D. J. Kleitman and D. L. Wang: Algorithm for constructing graphs and digraphs with given valences and factors. Discrete Math. 6 (1973), 79–88.MATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    J. S. Li and Z. X. Song: An extremal problem on the potentially P k-graphic sequences. Discrete Math. 212 (2000), 223–231.MATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    J. S. Li and Z. X. Song: The smallest degree sum that yields potentially P k-graphic sequences. J. Graph Theory 29 (1998), 63–72.MATHCrossRefMathSciNetGoogle Scholar
  8. [8]
    J. S. Li, Z. X. Song and R. Luo: The Erdős-Jacobson-Lehel conjecture on potentially P k-graphic sequences is true. Science in China, Ser.A 41 (1998), 510–520.MATHMathSciNetCrossRefGoogle Scholar
  9. [9]
    J. S. Li and J. H. Yin: A variation of an extremal theorem due to Woodall. Southeast Asian Bulletin of Mathematics 25 (2001), 427–434.MATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    R. Luo: On potentially C k-graphic sequences. Ars Combinatoria 64 (2002), 301–318.MATHMathSciNetGoogle Scholar
  11. [11]
    R. Luo and Morgan Warner: On potentially K k-graphic sequences. Ars Combinatoria 75 (2005), 233–239.MATHMathSciNetGoogle Scholar
  12. [12]
    A. R. Rao: The clique number of a graph with given degree sequence. Proc. Symposium on Graph Theory, A. R. Rao ed., MacMillan and Co. India Ltd., I.S.I. Lecture Notes Series 4 (1979), 251–267.Google Scholar
  13. [13]
    A. R. Rao: An Erdős-Gallai type result on the clique number of a realization of a degree sequence, unpublished.Google Scholar
  14. [14]
    J. H. Yin and J. S. Li: An extremal problem on potentially K r,s-graphic sequences. Discrete Math. 260 (2003), 295–305.MATHCrossRefMathSciNetGoogle Scholar
  15. [15]
    J. H. Yin and J. S. Li: Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size. Discrete Math. 301 (2005), 218–227.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Mathematical Institute, Academy of Sciences of Czech Republic 2007

Authors and Affiliations

  • Meng-Xiao Yin
    • 1
  • Jian-Hua Yin
    • 2
  1. 1.College of Computer and Electronics InformationGuangxi UniversityNanning, GuangxiChina
  2. 2.Department of Applied Mathematics, College of Information Science and TechnologyHainan UniversityHaikou, HainanChina

Personalised recommendations