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
View all GATE CS Papers >

Answer (Detailed Solution Below) 11

Free
GATE CS Full Mock Test
5.3 K Users
65 Questions 100 Marks 180 Mins

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

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 Graph Theory Questions

Hot Links: rummy teen patti teen patti flush teen patti mastar teen patti 51 bonus