Question

How can you tell if a graph is a tree by looking at the adjacency to matrix

Answer 1

Let's assume that a tree has N nodes, this means that this tree has N-1 edges.

For an adjacency matrix representing a tree, such will have 2(N-1) 1's, since each edge sets two bits in the matrix (with no 1's on the diagonal, since trees have no self-edges).