Facts About Graphs 1. In a complete graph (a graph with all possible edges), how many possible cycles are there that visit all V vertices and return to the start? (Assume the same basic route with a dierent start vertex is a dierent cycle.) 2. In a graph with V vertices where every vertex has degree 4, how many edges are in the graph? 3. The complement G of a graph G is the graph where if two vertices share an edge in G, there is no edge between them in G; and if they didn't have an edge in G, they do now. Figure out a formula for the number of edges in the complement of a graph with V vertices and E edges