| Minimal Elements in the Poset of Graphic Sequences |
| Received:December 28, 1997 |
| Key Words:
graph graphic sequence poset minimal elements.
|
| Fund Project:Supported by National Natural Science Foundation of China(19971086) |
|
| Hits: 2380 |
| Download times: 1150 |
| Abstract: |
| A nonincreasing sequence ( of n nonnegative integers is said to be graphic if it is the degree sequence of a simple graph G of order n. The set of all graphic sequences of n terms with even sum 2m and trace f is a poset Gｎ，ｍ，ｆ under majorization relation. The paper characterizes the minimal elements in the poset Gｎ，ｍ，ｆ and determines the number of minimal elements in various posets of graphic sequences. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.2000.02.003 |
| View Full Text View/Add Comment |
