超图的度序列.pdfVIP

1 r ℄ 2 ℄ S = (s , s , , s ) k (℄) 1 2 n ′ ′ ′ ′ k ℄ H S = (s , s , , s ) 1 2 n S ≺ S′ 3 k ℄ 0 0 0 0 n k ≥ 4, S = (s , s , , s ) 1 2 n r r  n − 2  r 0 ≤ s0 −    ()r = n     i i=1 2 k − 2 S0 ℄ k− 4 : k− Interchanger II Abstract In this paper,some results and reseaching condition of degree sequence of hypergraph are introduced in preface. In the first section , the definition of parasimple hypergraph and the sufficient and necessary condition of degree sequences of parasimple hy- pergraph are given, For the situation of r-uniformal simple hypergraph are simple hypergraph, degree sequences of r-uniformal simple hypergraph is solved at same time. Then the sufficient and necessary condition of degree sequence of connective parasimple hypergraph (r-uniformal simple hyper- graph) are given.