  In 2002, Tonchev first constructed some linear binary codes defined by the
adjacency matrices of undirected graphs. So, graph is an important tool for
searching optimum codes. In this paper, we introduce a new method of searching
(proposed) optimum formally self-dual linear binary codes from circulant
graphs.
