  In $2006$, Danielsen and Parker \cite{DP} proved that every self-dual
additive code over $GF(4)$ is equivalent to a graph code. So, graph is an
important tool for searching (proposed) optimum codes. In this paper, we
introduce a new method of searching (proposed) optimum additive codes from
circulant graphs.
