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

您当前的位置：

首页 >

文章列表页 >

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

更新时间：2026-01-21

- 一类0.1矩阵变换图的边连通性
- Journal of Xinjiang University (Natural Science Edition in Chinese and English) Issue 1, (1988)
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：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

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰