Let $V$ be the degree of each node and $E$ be the number of edges in the graph. As such, each digit on each city is $V$, and the number of roads will be $E$. The sum of all degrees will equal twice number of edges:
$\Sigma V=2E$
Therefore $2E=1+1+1+2+2+3+3+4+5 = 11$
There are $11$ complete roads among these cities.
The road map with red complete tracks can be illustrated as seen below: