Question

In: Advanced Math

A maximal plane graph is a plane graph G = (V, E) with n ≥ 3...

A maximal plane graph is a plane graph G = (V, E) with n ≥ 3 vertices such that if we join any two non-adjacent vertices in G, we obtain a non-plane graph.

a) Draw a maximal plane graphs on six vertices.

b) Show that a maximal plane graph on n points has 3n − 6 edges and 2n − 4 faces.

c) A triangulation of an n-gon is a plane graph whose infinite face boundary is a convex n-gon and all of whose other faces are triangles. How many edges does a triangulation of an n-gon have?

Solutions

Expert Solution

IF YOU HAVE ANY DOUBTS COMMENT BELOW I WILL BE TTHERE TO HELP YOU..ALL THE BEST..

AS FOR GIVEN DATA.

(b): Let G be a planar graph with n vertices and F faces and E number of edges .

Now , The boundary of every faces is a triangle , and each edge is on the boundary of two faces.

Therefore , if the number of edges on the boundary of a face is summed over all faces , the result will be 3F .

On the other hand, such a sum considers each edge twice .

So , 3F = 2E , i.e. , F=(2E)/3 and E=(3F)/2. ............... (i)

Applying Euler's formula ,

i.e., If a connected plane graph G has V vertices , E edges and F faces , then ,

.  V-E+F = 2.

We obtain the desired results;

V - E + F = 2.

=> n - E + F = 2. ................ (ii)

Now , from (i) we have ,

n - E + (2E/3) = 2

=> 3n - 3E + 2E = 6

=> 3n - E = 6

=> E=3n-6

Similarly ,

From (i) and (ii) , we have ,

n - E + F = 2

=> n - (3F/2) + F = 2

=> 2n - 3F + 2F = 4

=> 2n - F = 4

=> F=2n-4.

(c) : Let R (n) be a graph whose vertices are every distinct triangulation of the n-gon , and whose edges represent the ability to get from one triangulation to another via diagonal flip. Let Nn be the number of vertices of R (n) .

Since , Number of edges of an n-gon is (n-3) .

Therefore , there are (n-3) flips that can be performed on each triangulation, which means that the degree of each vertex of R(n) =(n-3) , which means that R(n) is an (n-3)-gon graph.

Thus , Number of edges of R(n) is {Nn × (n-3)}/2.  ( 2 in denominator is because each edge was considered twice).

I HOPE YOU UNDERSTAND..

PLS RATE THUMBS UP..ITS HELPS ME ALOT..

THANK YOU...!!


Related Solutions

If G = (V, E) is a graph and x ∈ V , let G \...
If G = (V, E) is a graph and x ∈ V , let G \ x be the graph whose vertex set is V \ {x} and whose edges are those edges of G that don’t contain x. Show that every connected finite graph G = (V, E) with at least two vertices has at least two vertices x1, x2 ∈ V such that G \ xi is connected.
Problem 2. Consider a graph G = (V,E) where |V|=n. 2(a) What is the total number...
Problem 2. Consider a graph G = (V,E) where |V|=n. 2(a) What is the total number of possible paths of length k ≥ 0 in G from a given starting vertex s and ending vertex t? Hint: a path of length k is a sequence of k + 1 vertices without duplicates. 2(b) What is the total number of possible paths of any length in G from a given starting vertex s and ending vertex t? 2(c) What is the...
Given an undirected graph G = (V,E), consisting of n vertices and m edges, with each...
Given an undirected graph G = (V,E), consisting of n vertices and m edges, with each edge labeled from the set {0,1}. Describe and analyze the worst-case time complexity of an efficient algorithm to find any cycle consisting of edges whose labels alternate 0,1.
Consider an unweighted, undirected graph G = <V, E>. The neighbourhood of a node v ∈...
Consider an unweighted, undirected graph G = <V, E>. The neighbourhood of a node v ∈ V in the graph is the set of all nodes that are adjacent (or directly connected) to v. Subsequently, we can define the neighbourhood degree of the node v as the sum of the degrees of all its neighbours (those nodes that are directly connects to v). (a) Design an algorithm that returns a list containing the neighbourhood degree for each node v ∈...
You are given a directed graph G(V,E) with n vertices and m edges. Let S be...
You are given a directed graph G(V,E) with n vertices and m edges. Let S be the subset of vertices in G that are able to reach some cycle in G. Design an O(n + m) time algorithm to compute the set S. You can assume that G is given to you in the adjacency-list representation.
For any n ≥ 1 let Kn,n be the complete bipartite graph (V, E) where V...
For any n ≥ 1 let Kn,n be the complete bipartite graph (V, E) where V = {xi : 1 ≤ i ≤ n} ∪ {yi : 1 ≤ i ≤ n} E = {{xi , yj} : 1 ≤ i ≤ n, 1 ≤ j ≤ n} (a) Prove that Kn,n is connected for all n ≤ 1. (b) For any n ≥ 3 find two subsets of edges E 0 ⊆ E and E 00 ⊆ E such...
Let G = (V, E) be a directed graph, with source s ∈ V, sink t...
Let G = (V, E) be a directed graph, with source s ∈ V, sink t ∈ V, and nonnegative edge capacities {ce}. Give a polynomial-time algorithm to decide whether G has a unique minimum s-t cut (i.e., an s-t of capacity strictly less than that of all other s-t cuts).
Determine, for a given graph G =V,E and a positive integer m ≤ |V |, whether...
Determine, for a given graph G =V,E and a positive integer m ≤ |V |, whether G contains a clique of size m or more. (A clique of size k in a graph is its complete subgraph of k vertices.) Determine, for a given graph G = V,E and a positive integer m ≤ |V |, whether there is a vertex cover of size m or less for G. (A vertex cover of size k for a graph G =...
Let G be a simple graph. G is said to be maximal planar if it is...
Let G be a simple graph. G is said to be maximal planar if it is planar and the addition of any new edge to G results in a (simple) non-planar graph. Examples of maximal non-planar graphs are K4 , K5 minus an edge, and K3,3 minus an edge. (a) Show that a maximal planar graph is connected. (b) Show that a maximal planar graph of order ≥3 has no bridges. (c) Show that every face of a maximal planar...
Prove that if G is a simple graph with |V (G)| = n even, where δ(G)...
Prove that if G is a simple graph with |V (G)| = n even, where δ(G) ≥ n 2 + 1, then G has a 3-regular spanning subgraph.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT