Planar Graph
Q1.
Let \delta denote the minimum degree of a vertex in a graph. For all planar graphs on n vertices with \delta \geq 3, which one of the following is TRUE?Q2.
In an undirected connected planar graph G, there are eight vertices and five faces. The number of edges in G is _________.Q3.
Choose the correct alternatives ( more than one may be correct) and write the corresponding letters only:A non-planar graph with minimum number of vertices hasQ4.
K4 and Q3 are graphs with the following structures Which one of the following statements is TRUE in relation to these graphs?Q6.
Let G be the non-planar graph with the minimum possible number of edges. Then G hasQ7.
Let G be a simple connected planar graph with 13 vertices and 19 edges. Then, the number of faces in the planar embedding of the graph is:Q9.
Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to