edited by
4,161 views

3 Answers

Best answer
5 votes
5 votes

Planar Graph :- planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other.

Here only Gis planar graph.

Hence,Option(D)G1 is not planar and G2 is planar.

selected by
0 votes
0 votes
The option will be (D). Both G1 is not Plannar but is plannar graph. In Plannar graphs, no two of its edges intersect.
0 votes
0 votes
No: of vertices in G2= 6

No:of edges in G2=12

By the corollary of Euler's formula, the following inequality must hold to say that G2 is planar.

e less than or equal to 3n-6

12 less than or equal to 3*6-6=12

12=12 ☑️

Therefore, G2 is planar.
Answer:

Related questions

5 votes
5 votes
2 answers
1
go_editor asked Jul 13, 2016
2,206 views
Two graphs A and B are shown below: Which one of the following statements is true?Both A and B are planarNeither A nor B is planarA is planar and B is notB is planar and ...
3 votes
3 votes
2 answers
2
go_editor asked Jul 7, 2016
3,011 views
The upper bound of computing time of m colouring decision problem is$O(nm)$$O(n^m)$$O(nm^n)$$O(n^mm^n)$
26 votes
26 votes
3 answers
3
gatecse asked Aug 5, 2014
9,977 views
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...