中文摘要：

图G中最大完全子图的阶数称为G的团数．ω（π）和γ（π）分别表示实现度序列π=（d1，d2……dn）的图的最大团数和最小团数．Erdoes．Jacobson和Lehel开始考虑确定具有相同度序列π的图的可能的团数问题．他们证明了对于充分大的n，有ω（π）-γ（π）→n→2n^2／3．在本文中，我们首先估计了一类特殊可图序列的ω（π）之值，其次我们建立了一个估计任意可图序列π的ω（π）之值的算法．

英文摘要：

The order of the largest complete subgraph in graph G is called the clique number of G. We write ω（π） and γ（π） to denote the largest clique number and the smallest clique number for graphs realizing the same degree sequence π = （d1, d2,..., dn）, respectively. Erdoes, Jacobson and Lehel began considering the question of the possible clique number attained by graphs with the same degree sequence π. They showed that ω（π） - γ（π） is approximately n - 2n^2/3, for sufficiently large n. In this paper, we estimate the values ω（π） for a special class of graphic sequences, which enables us to found an algorithm to estimate the value ω（π） for any graphic sequence π.