新疆大学学报(自然科学版)

1988, (01) 17-25

[打印本页] [关闭]
本期目录(Current Issue) | 过刊浏览(Past Issue) | 高级检索(Advanced Search)

一类0.1矩阵变换图的边连通性
The Edge Connectivity of Interchange Graphs of Classes of Matrices of Zeros and Ones

陈荣斯;郭晓峰;张福基;

摘要(Abstract):

<正> Let U (R, S) denote the class of all m×n matrices of 0's and 1's havingrow sum vector R and column sum vector S. The interchange graph G (R,S)is the graph where the vertices are the matrices in U (R, S) and where twomatrices are joined by an edge provided they differ by an interchange. Brualdishowed that the connectivity of G(R, S) is at least two. In the present paperwe prove that the edge connectivity of G(R, S) is equal to the minimum degreeof vertices of G(R, S)

关键词(KeyWords): 边连遇性;变换图;0.1矩阵

Abstract:

Keywords:

基金项目(Foundation): 国家自然科学基金

作者(Author): 陈荣斯;郭晓峰;张福基;

Email:

扩展功能
本文信息
服务与反馈
本文关键词相关文章
本文作者相关文章
中国知网
分享