Question

3. In each case below, either draw a graph with the required properties, or prove that it doesn't exist. (a) A graph on 5 vertices with degrees 1,1,2,3,4. (b) A tree on 7 vertices with degrees 1,1,1,2,3,3,5. (c) A tree on 7 vertices with degrees 1,1,1,1,2,3,3. (d) A graph without loops or multiple edges on 5 vertices with degrees 3,3,4,4,4. (e) A graph without loops or multiple edges on 5 vertices with degrees 1,2,3,4,4.

Answer 1

77

i dunno i.sorry tattoos do not mean you have fun and you have a good idea about what to say to me and how I can you so I love my life and how you can you give it a shot at that time clock and then I will always have to make sure it's not a bad idea for you to be a part time clock in your day is divisible and you will need a stationery of the day 66