## SOS - bipartite graphs

How do I prove: Given a connected d-regular graph G, if (-d) is an eigenvalue of G's adjacency matrix, then G is bipartite? (the reverse is pretty easy to see)