一类0.1矩阵变换图的边连通性

您当前的位置：

首页 >

文章列表页 >

一类0.1矩阵变换图的边连通性

工程技术 | 更新时间：2026-01-21

- 一类0.1矩阵变换图的边连通性
- 一类0.1矩阵变换图的边连通性
- 新疆大学学报（自然科学版中英文） 1988年第1期
- 作者机构：
- 作者简介：
- 基金信息：
  
  国家自然科学基金
- DOI：
  中图分类号：
- 纸质出版：1988
- 稿件说明：
移动端阅览
[1]陈荣斯,郭晓峰,张福基.一类0.1矩阵变换图的边连通性[J].新疆大学学报(自然科学版),1988(01):17-25.

陈荣斯, 郭晓峰, 张福基. 一类0.1矩阵变换图的边连通性[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 1988, (1).
[1]陈荣斯,郭晓峰,张福基.一类0.1矩阵变换图的边连通性[J].新疆大学学报(自然科学版),1988(01):17-25. DOI：

陈荣斯, 郭晓峰, 张福基. 一类0.1矩阵变换图的边连通性[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 1988, (1). DOI：

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

Let U (R

S) denote the class of all m×n matrices of 0's and 1's having row 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 two matrices are joined by an edge provided they differ by an interchange. Brualdi showed that the connectivity of G(R

S) is at least two. In the present paper we prove that the edge connectivity of G(R

S) is equal to the minimum degree of vertices of G(R

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

暂无数据