Computer search finds these three completions and no others:
$$\begin{array}{c|cccc}
\cdot & a & b & c & d \\\hline
a & a & c & c & a \\
b & d & b & b & d \\
c & a & c & c & a \\
d & d & b & b & d \\
\end{array}
$$
$$\begin{array}{c|cccc}
\cdot & a & b & c & d \\\hline
a & a & a & c & c \\
b & b & b & d & d \\
c & c & c & a & a \\
d & d & d & b & b \\
\end{array}
$$
$$\begin{array}{c|cccc}
\cdot & a & b & c & d \\\hline
a & a & b & c & d \\
b & a & b & c & d \\
c & d & c & b & a \\
d & d & c & b & a \\
\end{array}
$$
You listed the 6 relatively primes to $18$, and not the primes, which is correct.
Your Cayley table is also (somewhat) correct, but note that we are working in $\Bbb Z_{18}$, i.e. modulo $18$. That is, you should rather put the remainders of the calculated products modulo $18$.
For example, the last term is $17^2 =289\equiv 1\pmod{18}$ (because $288$ is even and its digits sum to $18$ which is divisible by $9$).
(By the way, if you keep on adding the digits in the numbers in your table until you reach 1 digit, then if the result is odd, it's just the remainder, if it's even, subtract $9$.)
But that's also a consequence of $17\equiv -1\pmod{18}$ (meaning that their difference is divisible by $18$), and that congruent numbers are interchangeable in modular arithmetic, just like equal numbers are so in normal arithmetic (i.e. one has e.g. $a\equiv b\pmod m\implies ac\equiv bc\pmod m$ and thus if also $c\equiv d$, then $ac\equiv bc\equiv bd$.)
So, here is a simplified version of the same Cayley table you wrote, but using smallest absolute value representatives:
$$\matrix{\times \\
& 1&5&7&-7&-5&-1\\
& 5&7&-1&1&-7&-5\\
& 7&-1&-5&5&1&-7\\
& -7&1&5&-5&-1&7\\
& -5&-7&1&-1&7&5\\
& -1&-5&-7&7&5&1}$$
You can also observe that $5$ generates this group: keeping multiplying by $5$ we receive the following cycle containing all group elements:
$$1\,\mapsto\, 5\,\mapsto \, 7\,\mapsto \, -1\,\mapsto \, -5\,\mapsto \, -7\,\mapsto \, 1\,\mapsto \, \dots $$
Best Answer
$(\{0,1,2,3,4\},\cdot_{\bmod 5})$ is not a group: $0$ has no inverse.
Anyway, as the table is symmetric, you can see that the operation is commutative.
And also, if you remove the $0$ from the set, you do get a group.
Units are just invertible elements, from your table you can see that for every number $x$ in $\{1,2,3,4\}$, there exists another number $y$ in the set such that $x\cdot y =0 \pmod 5$