Put $x_{ij}=x_{ji}$ and consider the symmetriс matrix $A=(x_{ij})$ with zeros on diagonal. Then $\operatorname{tr} A=0$, $\operatorname{tr} A^2=2\sum_{i<j} x_{ij}^2=2$ is fixed, denote it $2=30 \alpha^2$ and what should be maximized is nothing but $\operatorname{tr} A^3=6\sum_{i<j<k} x_{ij}x_{ik}x_{jk}$, the conjectured maximal value is $6{6\choose 3}\alpha^3=120\alpha^3$. So, for eigenvalues $t_i$ we have $\sum t_i=0$, $\sum t_i^2=30\alpha^2$ and want to prove $\sum t_i^3\leqslant 120\alpha^3$. If $t_1=\ldots=t_5=-\alpha$ and $t_6=5\alpha$, we have equality (and this is realized when all $x_{ij}$ are equal to $\alpha$).
Well, let's try the following standard trick. Imagine that we have $(t_i-5\alpha)(t_i+\alpha)^2\leqslant 0$ for all $i$, then sum up and get the bound of $\sum t_i^3$ via $\sum t_i^2$ which turns into equality in our case, so this bound is $120\alpha^3$ (a direct check: what we get is $\sum t_i^3\leqslant 3\alpha\sum t_i^2+6\cdot 5\alpha^3=120\alpha^3$). Ok, if not, say, if $t_6>5\alpha$, then we have $t_1^2+\ldots+t_5^2\geqslant \frac{(t_1+\ldots+t_5)^2}5=\frac{t_6^2}5>5\alpha^2$, also $t_6^2>25\alpha^2$ and $\sum t_i^2>30\alpha^2$, a contradiction.