7 août 20193 août 2020 Bastien Pasdeloup A graph is composed of two key elements. What are they? A set of vertices. A set of circles. A set of lines. A set of edges. Edges in graphs and in digraphs are different. What do they respectively correspond to? Couples/Pairs. Pairs/Couples. Pairs/Pairs. Consider the edge sequence {v1, v2}, {v2, v4}, {v4, v6} in a complete graph with vertices V = {v1, v2, v3, v4, v5, v6}. Which of the following statements are true? It is a path. It is a cycle. It is a walk. Consider V = {v1, v2, v3, v4}. For which following values of E is G = (V, E) a tree? {{v1, v2}, {v2, v3}, {v3, v4}, {v1, v4}}. {{v1, v2}, {v2, v3}, {v3, v4}}. {{v1, v2}, {v3, v4}}. {{v1, v2}, {v1, v3}, {v1, v4}}. What is the size of a complete graph with an order of n? n(n-1)/2. n² 2n Time is Up!
