| A New Proof of Beineke-Harary′s Theorem |
| Received:March 02, 1993 |
| Key Words:
digraphic sequence potentially P-digraphic sequence. strongly-connected criterion.
|
| Fund Project:Supported by National Natural Science Fundation of China. |
|
| Hits: 2675 |
| Download times: 1226 |
| Abstract: |
| A sequence of n orered pairs of nonnegative integers is digraphic if it is the degree sequence of some digraph of ordern. A digraphic sequence is potentially stronglyconnected if it is the degree sequence of some strongly-connected digraph. Beineke and Harary[1] gave a criterion for a digraphic sequence being potentially strongly-connected. The proof of the sufficiency of Beineke-Harary Criterion is "considerably longer" (See [1]). The purpose of the paper is to give a shorter proof of the sufficiency of Beineke-Harary Criterion. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.1996.01.009 |
| View Full Text View/Add Comment |
