Fisher's inequality for designs on regular graphs (Q5957823): Difference between revisions

It is shown that for a \((v,k,\lambda, \mu)\)-design on a regular graph with adjacency matrix \(A\), \( r\geq v \) if \((r-\lambda)/(\mu-\lambda)\) is not a multiple eigenvalue of \(A\), where \(r\) is the replication number of the design.