首页   按字顺浏览 期刊浏览 卷期浏览 Construction of a Maximally Edge‐Connected Graph with Prescribed Degrees
Construction of a Maximally Edge‐Connected Graph with Prescribed Degrees

 

作者: D. L. Wang,  

 

期刊: Studies in Applied Mathematics  （WILEY Available online 1976）
卷期: Volume 55, issue 1  

页码: 87-92

 

ISSN:0022-2526

 

年代: 1976

 

DOI:10.1002/sapm197655187

 

数据来源: WILEY

 

摘要:

Let 〈d1,d2,...,dp,〉 be a realizable degree sequence,di⩾2; then a graphGcan be constructed so that deg(viand so that fori≠j, the number of edge‐disjoint paths betweenviandvji

 

点击下载:  PDF (676KB)



返 回