Question If graph is tree what can be said about its adjacency matrix ? And vice versa ?

Especially I am interested in case when graph is bipartite graph.

Such graphs are related to error-correction codes (see e.g. Adjacency matrices of graphs as parity check matrices of error correcting codes ). If they are trees belief propagation is known to produce exact results.