Maximum nullity and zero forcing number of graphs with rank at most 4

摘要

Let G be a simple graph with n vertices. The rank of G is the number of non-zero eigenvalues of its adjacency matrix and denoted by rank(G). In this paper, we show that if rank(G)=2, then z...