| 李炯生.整数偶序列为蕴含强连通的Beineke－Harary判准[J].数学研究及应用,1996,16(1):47~50 |
| 整数偶序列为蕴含强连通的Beineke－Harary判准 |
| A New Proof of Beineke-Harary′s Theorem |
| 投稿时间：1993-03-02 |
| DOI：10.3770/j.issn:1000-341X.1996.01.009 |
| 中文关键词: |
| 英文关键词:digraphic sequence potentially P-digraphic sequence. strongly-connected criterion. |
| 基金项目: |
|
| 摘要点击次数: 2460 |
| 全文下载次数: 1167 |
| 中文摘要: |
| 一个由ｎ个非负整数有序对构造的序列是有向可图的，如果它是某个有向图的度序列．一个有向可图序列是蕴含强连通的，如果它是某个强连通有向图的度序列．Ｂｅｉｎｅｋｅ和Ｈａｒａｒｙ给出了一个有向可图序列为蕴含强连通的判准．Ｂｅｉｎｅｋｅ－Ｈａｒａｒｙ判准的充分性证明是“相当长”的（见［１］）．本文的目的是给出Ｂｅｉｎｅｋｅ－Ｈａｒａｒｙ判准的充分性的一个简短证明． |
| 英文摘要: |
| 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. |
| 查看全文 查看/发表评论 下载PDF阅读器 |
