| 整数偶序列为蕴含强连通的Beineke－Harary判准 |
| |
| 引用本文： | 李炯生. 整数偶序列为蕴含强连通的Beineke－Harary判准[J]. 数学研究及应用, 1996, 16(1): 47-50 |
| |
| 作者姓名： | 李炯生 |
| |
| 作者单位： | 合肥中国科技大学数学系 |
| |
| 摘 要： | 一个由ｎ个非负整数有序对构造的序列是有向可图的,如果它是某个有向图的度序列．一个有向可图序列是蕴含强连通的,如果它是某个强连通有向图的度序列．Ｂｅｉｎｅｋｅ和Ｈａｒａｒｙ给出了一个有向可图序列为蕴含强连通的判准．Ｂｅｉｎｅｋｅ－Ｈａｒａｒｙ判准的充分性证明是“相当长”的（见［１］）．本文的目的是给出Ｂｅｉｎｅｋｅ－Ｈａｒａｒｙ判准的充分性的一个简短证明．
|
| 收稿时间： | 1993-03-02 |
A New Proof of Beineke-Harary's Theorem |
| |
| Li Jiongsheng. A New Proof of Beineke-Harary's Theorem[J]. Journal of Mathematical Research with Applications, 1996, 16(1): 47-50 |
| |
| Authors: | Li Jiongsheng |
| |
| Affiliation: | Dept. of Math. Univ. of Sci. and Tech. of China. Hefei 230026 |
| |
| 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. |
| |
| Keywords: | digraphic sequence potentially P-digraphic sequence. strongly-connected criterion. |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
|
点击此处可从《数学研究及应用》下载全文 |
