The largest number of faces in a simple connected maximal planar graph with 100 vertices is :

This question was previously asked in
NIELIT Scientific Assistant CS 5 Dec 2021 Official Paper
View all NIELIT Scientific Assistant Papers >
  1. 200 
  2. 198 
  3. 196 
  4. 96

Answer (Detailed Solution Below)

Option 3 : 196 
Free
NIELIT Scientific Assistant Quantitative Aptitude Mock Test
0.5 K Users
20 Questions 20 Marks 30 Mins

Detailed Solution

Download Solution PDF

Concept:

For a simple connected maximal planar graph with \( n \) vertices:

The graph is a triangulation, meaning every face (except possibly the outer one) is a triangle.

In such graphs, the number of edges \( e \) is given by:

\( e = 3n - 6 \)

Using Euler's formula:

\( n - e + f = 2 \)

Given:

\( n = 100 \)

So, number of edges:

\( e = 3(100) - 6 = 294 \)

Now, apply Euler's formula to find faces:

\( f = 2 - n + e = 2 - 100 + 294 = 196 \)

Final Answer:196

Latest NIELIT Scientific Assistant Updates

Last updated on Feb 20, 2025

-> A total number of 113 revised vacancies have been announced for the post of Scientific Assistant in Computer Science (CS), Information Technology (IT), and Electronics & Communication (EC) streams.

-> Online application form, last date has been extended up to from 17th April 2025.

->The NIELT has revised the Essential Qualifications for the post of Scientific Assistant. Candidates must possess (M.Sc.)/ (MS)/ (MCA) / (B.E.)/ (B.Tech) in relevant disciplines.

 

-> The NIELIT Scientific Assistant 2025 Notification has been released by the National Institute of Electronics and Information Technology (NIELIT).

More Planarity Questions

More Graph Theory Questions

Get Free Access Now
Hot Links: teen patti fun real cash teen patti teen patti master download teen patti master game teen patti pro