Let a graph have vertices D,E,F,G,H,ID,E,F,G,H,I and edge set {{D,E},{D,F},{D,G},{D,H},{E,I},{H,I}}{{D,E},{D,F},{D,G},{D,H},{E,I},{H,I}}.
Draw the graph.
What is the degree of vertex G?
What is the degree of vertex D?
How many components does the graph have?
Which of the following degree sequences are possible for a simple graph?
(5,3,3,3,2,2)
(9,8,8,7,4,4,4,2,2,1)
(8,6,3,3,2,2,2,1)
(6,5,4,4,3,3,3)

You are a mail deliverer. Consider a graph where the streets are the edges and the intersections are the vertices. You want to deliver mail along each street exactly once without repeating any edges. Would this path be represented by a Euler circuit or a Hamiltonian circuit?
What is the order of the graph?
What is the degree of vertex N?
What is the degree of vertex G?
How many components does the graph have?