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 toa)3b)4c)5d)6Correct answer is option 'D'. Can you explain this answer?

Explore Courses UPSC Exam UPSC Test Series Free Notes EduRev Infinity

Open App

GATE Exam > GATE Questions > Let G be a simple undirected planar graph on ...

Join the Discussion on the App

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

a)
3
b)
4
c)
5
d)
6

Correct answer is option 'D'. Can you explain this answer?

FREE This question is part of

Computer Science And Information Technology - CS 2012 GATE Paper (Practice Test)

Attempt Test

Attempt this Test

Verified Answer

Let G be a simple undirected planar graph on 10 vertices with 15 edges...

We have the relation V-E+F=2, by this we will get the total number of faces,

F = 7. Out of 7 faces one is an unbounded face, so total 6 bounded faces.

View all questions of this test

View all answers Start learning for free

< Previous Question Next Question >

Explore Courses for GATE exam

Similar GATE Doubts

Consider the following statement about the planarity of the graph.(1) The number of regions (r) in a graph G (V, E) can be given by Euler formula r = E + V – 2(2) If G is a connected planar simple graph with e edges and v vertices, where v >= 3 then(e (3) If in a planar graph G (v, e) there is a cycle with 4 or more vertices then (e (4) Bipartite can’t have odd length cycles.The number of correct statements is ________________? Correct answer is '3'. Can you explain this answer?

View answer

What is the number of vertices in an undirected connected graph with 27 edges, 6 vertices of degree 2, 3 vertices of degree 4 and remaining of degree 3?

View answer

Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements:I. Minimum Spanning Tree of G is always unique.II. Shortest path between any two vertices of G is always unique.Q. Which of the above statements is/are necessarily true?

View answer

G is a simple, connected, undirected graph. Some vertices of G are of odd degree. Add a node v to G and make it adjacent to each odd degree vertex of G. The resultant graph is sure to be

View answer

An ordered n-tuple (d1, d2, .... dn) with d1 ≥ d2≥... ≥ dn is called graphic if there exists a simple undirected graph with n vertices having degrees d1, d2, ..., dn respectively. Which of the following 6-tuples is NOT graphic?

View answer

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 toa)3b)4c)5d)6Correct answer is option 'D'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
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 toa)3b)4c)5d)6Correct answer is option 'D'. Can you explain this answer? for GATE 2024 is part of GATE preparation. The Question and answers have been prepared according to the GATE exam syllabus. Information about 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 toa)3b)4c)5d)6Correct answer is option 'D'. Can you explain this answer? covers all topics & solutions for GATE 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for 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 toa)3b)4c)5d)6Correct answer is option 'D'. Can you explain this answer?.

Solutions for 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 toa)3b)4c)5d)6Correct answer is option 'D'. Can you explain this answer? in English & in Hindi are available as part of our courses for GATE. Download more important topics, notes, lectures and mock test series for GATE Exam by signing up for free.

Here you can find the meaning of 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 toa)3b)4c)5d)6Correct answer is option 'D'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of 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 toa)3b)4c)5d)6Correct answer is option 'D'. Can you explain this answer?, a detailed solution for 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 toa)3b)4c)5d)6Correct answer is option 'D'. Can you explain this answer? has been provided alongside types of 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 toa)3b)4c)5d)6Correct answer is option 'D'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice 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 toa)3b)4c)5d)6Correct answer is option 'D'. Can you explain this answer? tests, examples and also practice GATE tests.

Explore Courses for GATE exam