| 一类0.1矩阵变换图的边连通性 |
| |
| 引用本文： | 陈荣斯,郭晓峰,张福基.一类0.1矩阵变换图的边连通性[J].新疆大学学报(理工版),1988(1). |
| |
| 作者姓名： | 陈荣斯 郭晓峰 张福基 |
| |
| 作者单位： | Chen Rongsi;Guo Xiaofeng;Zhang Fuji College of Finance and Economics，Fuzhou University Department of Mathematics，Xinjiang University |
| |
| 摘 要： | 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)
|
| 关 键 词： | 边连遇性 变换图 0.1矩阵 |
The Edge Connectivity of Interchange Graphs of Classes of Matrices of Zeros and Ones |
| |
| Chen Rongsi,Guo Xiaofeng,Zhang Fuji College of Finance and Economics,Fuzhou University.The Edge Connectivity of Interchange Graphs of Classes of Matrices of Zeros and Ones[J].Journal of Xinjiang University(Science & Engineering),1988(1). |
| |
| Authors: | Chen Rongsi Guo Xiaofeng Zhang Fuji College of Finance and Economics Fuzhou University |
| |
| Institution: | Chen Rongsi,Guo Xiaofeng,Zhang Fuji College of Finance and Economics,Fuzhou University Department of Mathematics,Xinjiang University |
| |
| Abstract: | |
| |
| Keywords: | edge connectivity interchange graphs matrices of zeros and one |
| 本文献已被 CNKI 等数据库收录！ |
|
