# How to draw a graph for the set of strings…? [closed]

How to draw a graph that represents the set of strings of 0's and 1's containing

• well, as you suggested, you are missing details. – Jorge Fernández Hidalgo Dec 4 '19 at 22:24
• To add to Jorge's comment, there should be some restrictions on the graph. Should it be maybe connected? Otherwise you can just take the trivial case of a disconnected graph with an empty edge-set and countable vertex-set. – Randy Savage Dec 4 '19 at 22:31
• You could think of these strings as paths in a graph with three vertices representing $0$,$1$,$11$, with no edge between $1$ and $11$, edges between the other two pairs of points and a loop at $0$. – S. Dolan Dec 4 '19 at 22:43
• You would not go from 1 to 11 because that would give you three 1s in succession. – S. Dolan Dec 4 '19 at 23:07
• That would allow you to loop round lots of times and again get lots of 1s. – S. Dolan Dec 4 '19 at 23:09