Planar Graphs and Euler's Formula

The video tutorial explains how to determine the number of edges in a graph using the handshake lemma, which states that the sum of the degrees of all vertices is twice the number of edges. The graph in question has six vertices with degrees 2, 2, 3, 4, 4, and 5, leading to a total of 10 edges. The tutorial then explores whether the graph can be planar by applying Euler's formula, which relates vertices, edges, and faces. It concludes that the graph could be planar with six faces. The video also demonstrates constructing a planar graph that meets these conditions and verifies its properties, ensuring it is connected and has no crossing edges.

What is the degree sequence of the graph described in the introduction?

• 2, 2, 3, 4, 4, 5

• 3, 3, 4, 4, 5, 5

• 1, 2, 3, 4, 5, 6

• 2, 3, 3, 4, 5, 5

According to the Handshake Lemma, what is the relationship between the sum of vertex degrees and the number of edges?

• The sum is unrelated to the number of edges

• The sum is half the number of edges

• The sum is twice the number of edges

• The sum is equal to the number of edges

How many edges does the graph have, as calculated using the Handshake Lemma?

• 9

• 8

• 11

• 10

What formula is used to determine if a graph could be planar?

• Newton's Laws

• Euler's Formula

• Pythagorean Theorem

• Fermat's Last Theorem

Using Euler's formula, how many faces would a planar graph with 6 vertices and 10 edges have?

• 5

• 7

• 4

• 6

What is the first step in verifying the planarity of the graph?

• Finding the number of faces

• Calculating the degree of each vertex

• Checking for crossing edges

• Counting the number of vertices

How many vertices does the constructed planar graph have?

• 7

• 6

• 5

• 4

What is the degree of the last vertex in the constructed graph?

• 5

• 4

• 3

• 2

What confirms the graph is planar in the final verification?

• It has no crossing edges

• It has more than 10 edges

• It has less than 6 faces

• It is not connected

What is the total number of faces in the verified planar graph?

• 4

• 5

• 7

• 6