Before revision: A       signed graph is a graph with a sign assignment to its edges.
After revision: A if it is chordal, and every cycle of even length larger than 6 has an odd chord (a chord that connects two vertices that are an odd distance apart in the cycle). In this work, we show that a graph is strongly chordal if and only if it has an intersection representation by unit balls in a signed graph is a graph with a sign assignment to its edges.