All the twenty vertices of a dodecahedral graph has the odd degree three. Therefore by Euler's theorem it cannot be made with one string. We note that if the number of odd vertices of a graph is n, then it takes at least n/2 strings to construct the graph.
Therefore it takes at least ten strings to make a dodecahedron.