Draw a simple undirected graph G that has 12 vertices, 18 edges, and 3 connected
Components.
2) If G is a simple undirected graph with 12 vertices and 3 connected components,
What is the largest number of edges it might have?
3) Draw a simple, connected, directed graph with 8 vertices and 16 edges such that
the in-degree and out-degree of each vertex is 2. Show that there is a single
(non simple) cycle that includes all the edges of your graph, that is, you can trace
all the edges in their respective directions without ever lifting your pencil. (Such
a cycle is called an Euler tour.)
4) Suppose we represent a graph G having n vertices and m edges with the edge list
structure. Why, in this case, does the insertVertex method run in O(1) time while
the removeVertex method runs in O(m) time?