A signed graph is a pair $(G, \sigma)$, where $G$ (loops and multi edges allowed) $\sigma: E(G) \to \{+, -\}$ signature which assigns to each edge of sign. Various notions coloring graphs have been studied. In this paper, we extend circular graphs. Given \sigma)$ with no positive loop, $r$-coloring an assignment $\psi$ points circle circumference $r$ the vertices such that for every $e=uv$ $G$,...