摘要
A noninereasing sequence π of n nonnegative integers graphical is graphical if it is the degree sequence of some simple graph G of order n. All graphical sequences of length n with even sum 2m and trace f forms a poset Gn, m,f under majoriztion relation. In this paper, we characterizc the minimal elememts in Gn, m, f and determine the numbers of minimal elememts in various posers of graphical sequences.
A noninereasing sequence π of n nonnegative integers graphical is graphical if it is the degree sequence of some simple graph G of order n. All graphical sequences of length n with even sum 2m and trace f forms a poset Gn, m,f under majoriztion relation. In this paper, we characterizc the minimal elememts in Gn, m, f and determine the numbers of minimal elememts in various posers of graphical sequences.
出处
《黄山学院学报》
1999年第3期108-111,共4页
Journal of Huangshan University
