Maximum order of trees and bipartite graphs with a given rank (Q1759390): Difference between revisions

A graph is called reduced if there exist no isolated vertices and no vertices with the same neighbourhood. The rank of a graph \(G\) is the rank of its adjacency matrix. The authors prove that every reduced tree of rank \(r\) has at most \(r/2-1\) vertices and that every reduced bipartite of rank \(r\) has at most \(2^{r/2} + r/2 -1\) vertices. They give also characterisations of the classes of graphs which achieve the bounds.