节点文献

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

免费订阅

【作者】 陈荣斯郭晓峰张福基

【Author】 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矩阵
【基金】 国家自然科学基金
  • 【被引频次】4
  • 【下载频次】35
节点文献中: 

本文链接的文献网络图示:

浏览历史:
下载历史: