A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On bipartite graphs which attain minimum rank among bipartite graphs with given diameter

2012
*
The Electronic Journal of Linear Algebra
*

Hui-xian. (2012) , "On bipartite graphs which attain minimum rank among bipartite graphs with given diameter", Abstract. The rank of a graph is defined to be the rank of its adjacency matrix. In this paper, the bipartite graphs that attain the minimum rank among bipartite graphs with a given diameter are completely characterized. http://math.technion.ac.il/iic/ela As shown in [9] , there are only finitely many reduced graphs with given rank. Let BG(d) denote the finite set of reduced bipartite

doi:10.13001/1081-3810.1510
fatcat:iyyifrfp7naj5hofyqs5w67nq4