Suppose that for every positive integer I, all the entries in the ith row and ith column of the adjacency matrix of a graph are 0. What can you conclude about the graph?

What can you conclude about the graph?

Given information:

Suppose that for all positive integers i, all the entries in the ith row and ith column of the adjacency matrix of a graph are 0.

Calculation:

The adjacency matrix A = [aij] is n×n zero-one matrix with

aij={1                     if there is an edge from  v i to  v j0