Question
1.48
18.
Can you draw a graph with at least two vertices for which all the vertices have different valences?
Can you do this so that the valences are consecutive integers?