We need to maximise the number of 1. Clearly, there cannot be a triangle of ones, so by Turan there are at most 1012^2. It’s easy to see that the Turan graph satisfies the criterion.

Alternatively - no odd cycles, thus bipartite, thus $1012^2$ by AM-GM.