If P = NP, why wouldn't $\emptyset$ and $\Sigma^*$ be NP-complete?
As there are no strings in $\emptyset$, any machine that computes it always rejects, so we can't map Yes-instance of other problems to anything. Similarly for $\Sigma^{\ast}$ there's nothing to map No-instances to.