1 paper
H. Esmailian, E. Ghorbani, S. Hossein Ghorban +1
The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors.…