Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More

Question

Download Solution PDF

In an undirected connected planar graph G, there are eight vertices and five faces. The number of edges in G is ______

This question was previously asked in
GATE CS 2021 Official Paper: Shift 1
Download PDF Attempt Online
View all GATE CS Papers >

Answer (Detailed Solution Below) 11
Free Tests
View all Free tests >
Free
GATE CS Full Mock Test
5.3 K Users
65 Questions 100 Marks 180 Mins
Start Now

Detailed Solution

Download Solution PDF

Data

Number of vertices = V = 8

Number of faces = 5

Number of edges = E

Euler's formula:

V + F = E + 2

Calculation

⇒ E = V + F - 2

⇒ E = 8 + 5 - 2

⇒ E = 11 

∴ Number of edges is 11

Download Solution PDF
Latest GATE CS Updates

Last updated on Jan 8, 2025

-> GATE CS 2025 Admit Card has been released on 7th January 2025.

-> The exam will be conducted on 1st February 2025 in 2 shifts.

-> Candidates applying for the GATE CE must satisfy the GATE Eligibility Criteria.

-> The candidates should have BTech (Computer Science). Candidates preparing for the exam can refer to the GATE CS Important Questions to improve their preparation.

-> Candidates must check their performance with the help of the GATE CS mock tests and GATE CS previous year papers for the GATE 2025 Exam.

More Planarity Questions

Q1.The largest number of faces in a simple connected maximal planar graph with 100 vertices is :
Q2.Which of the following Graphs is(are) planar? A.  B.  C. Choose the correct answer from the options given below : 
Q3.The number of vertices in polyhedron which has 30 edges on 12 faces is
Q4.K4 and Q3 are graphs with the following structures. Which one of the following statements is TRUE in relation to these graphs?
Q5.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
Q6.The line graph L(G) of a simple graph G is defined as follows: There is exactly one vertex v(e) in L(G) for each edge e in G. For any two edges e and e' in G, L(G) has an edge between v(e) and v(e'), if and only if e and e' are incident with the same vertex in G. Which of the following statements is/are TRUE? (P) The line graph of a cycle is a cycle. (Q) The line graph of a clique is a clique. (R) The line graph of a planar graph is planar. (S) The line graph of a tree is a tree.
Q7.In an undirected connected planar graph G, there are eight vertices and five faces. The number of edges in G is ______
Q8.Let δ denote the minimum degree of a vertex in a graph. For all planar graphs on n vertices with δ ≥ 3, which one of the following is TRUE?
Q9.Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is ________. 

More Graph Theory Questions

Q1.Which of the following statements is/are TRUE for undirected graphs?
Q2.The largest number of faces in a simple connected maximal planar graph with 100 vertices is :
Q3.Which of the following Graph is/are planer? Choose the most appropriate answer from the options given below:
Q4.Arrange the following graph on the basis of number of edges in increasing order [for n > 3] A. Kn (Complete Graph) B. Cn (Cycle graph) C. Wn (Wheel graph) D. Kn, n (Complete Bipartite Graphs) E. Qn (n-cubes graph) Choose the correct answer from the options given below:
Q5.Which of the following graphs are trees ?  A.  B.  C.  D.  Choose the correct answer from the options given below :  
Q6.Statement 1: Given a graph G = (V, E) in which each vertex v ∈ V has an associated positive weight w(v), we can use linear programming to find the lower bound on the weight of the minimum-weight vertex cover. Statement 2: The lower bound can be found by maximizing the following \(\rm\sum_{v \in V}^n {w}(v) {x}(v)\) subject to x(u) + x(v) ≥ 1 for each (u, v) ∈ V x(v) ≤ 1 for each v ∈ V x(v) ≥ 0 for each v ∈ V In the light of the above statements, choose the most appropriate answer from the options given below:
Q7.Match List I with List II LIST - I LIST - II A. Planar Graph I. Probabilistic Model B. Bipartite Graph II. Deterministic Model C. PERT III. 4-Colorable D. CPM IV. 2-Colorable Choose the correct answer from the options given below:
Q8.Consider the following statements: P: There exists no simple, undirected and connected graph with 80 vertices and 77 edges. Q: All vertices of Euler graph are of even degree. R: Every simple, undirected, connected and acyclic graph with 50 vertices has at least two vertices of degree one. S: There exits a bipartite graph with more than ten vertices which is 2-colorable. What is the number of correct statements among the above statements.
Q9.A principal node is a
Q10.A star connected network consumes a power of 20 kW with a power factor of 0.8. Calculate the value of resistance of each coil when a supply voltage of 230 volts and 50 Hz is supplied between two phases of the network.
Crack GATE CSE with
India's Super Teachers
Explore Supercoaching For FREE
Suggested Test Series
View All >
GATE Mathematics & General Aptitude (Common for All) Test Series
92 Total Tests with 0 Free Tests
Start Free Test
ISRO Scientist Computer Science Mock Test
22 Total Tests with   1 Free Tests
Start Free Test
Suggested Exams
Exam-Logo
GATE CS

GATE CS Important Links

More Engineering Mathematics Questions

Q1.If L = {1, 2, 3, 4, 6, 9, 36} is the lattice find the number of complements 9 is having in the below given Hasse diagram?
Q2.Which of the following statements is/are TRUE for undirected graphs?
Q3.\(\iint \frac{x y}{\sqrt{1-y^{2}}} d x d y\) Over the positive quadrant of the circle x2 + y2 = 1 is __________.
Q4.The real root of the equation x3 − x − 5 = 0 lying between 1 and 2 after first iteration by Newton-Raphson method is ________, if initial approximation is taken as x0 = 2 ∈ [1, 2] : 
Q5.Let X be uniform random variable on [0, 4] and Y be uniform random variable on [0, 1]. If X and Y are independent, then P(max {X, Y} > 3) is equal to : 
Q6.If R and D are the radius and diameter of the graph K4,7, then the ordered pair (R, D) is equal to : 
Q7.The largest number of faces in a simple connected maximal planar graph with 100 vertices is :
Q8.If for the matrix A, A3 = I then A−1 = __________. 
Q9.Energy of power signal is : 
Q10.With usual notations, the properties of maxima and minima under various conditions are __________. I II (P) Maxima (i) r t− s2 = 0 (Q) Minima (ii) rt − s2 < 0 (R) Saddle Point (iii) rt − s2 > 0, r > 0 (S)  Case of failure (iv) rt − s2 > 0, r < 0
Important Links for GATE Exam
Super Coaching
Branch wise Page
Test Series
Previous Year Papers
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
[email protected]
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Our Apps
Follow us on
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Hot Links： teen patti lucky teen patti real cash game teen patti refer earn