| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421349 | Discrete Applied Mathematics | 2008 | 5 Pages |
Abstract
A finite sequence of nonnegative integers is called graphic if the terms in the sequence can be realized as the degrees of vertices of a finite simple graph. We present two new characterizations of graphic sequences. The first of these is similar to a result of Havel-Hakimi, and the second equivalent to a result of Erdős & Gallai, thus providing a short proof of the latter result. We also show how some known results concerning degree sets and degree sequences follow from our results.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Amitabha Tripathi, Himanshu Tyagi,