recategorized by
1,308 views
1 votes
1 votes

G1 and G2 are two graphs as shown—

(A) Both 01 and G2 are planar graphs

(B) Both G1 and G2 are not planar graphs

(C) GI is planar and G2 is not planar graph

(D) G1 is not planar and G2 is planar graph

recategorized by

1 Answer

2 votes
2 votes

If a graph is planar satisfy these constraints,those are

i)r=e-v+2    // from this find 'r'

ii)kr<=2e             // substitute here.

iii)e<=k(v-2)/k-2.  //'k' is min  degree of region

Consider graph G1 assume it is planar

k=4,e=9,v=6.

i)r=9-6+2=5

ii) 4r<=2e

4*5<=2*9     // condition fails so graph is nonplanar.

Consider graph G2 assume it is planar. 

k=3,e=11,v=6

i)r=11-6+2=7

ii)3r<=2e 

3*7<=2*11   // it satisfying

iii)e<=k*(v-2)/k-2

11<=3*(6-2) 

so it satisfying all conditions our assumption is correct.

Hence G1 is nonplanar and G2 is planar.

Answer:

Related questions

0 votes
0 votes
1 answer
1
Dhiraj_777 asked May 4, 2023
514 views
In a Connected Planar Bipartite Graph of order 10 atmost how many edges be present ?
1 votes
1 votes
0 answers
2
Shamim Ahmed asked Dec 21, 2018
818 views
In a connected 3 regular graph, every planar region is bounded by exactly 5 edges, then count no of edges?
0 votes
0 votes
1 answer
3
Na462 asked Dec 2, 2018
3,532 views
Let G be a simple connected planar graph with 14 vertices and 20 edges. Number of closed regions in planar embedding of the graph is ?
0 votes
0 votes
1 answer
4
srestha asked Oct 22, 2018
1,664 views
Can minimum degree of a planar graph be $5$? Give some example