GATE CS 2017 (Afternoon) — Question 23

Discrete MathematicsGraph Theory (Connectivity, Paths, Cycles, Trees)NAT1 markMedium

\(G\) is an undirected graph with \(n\) vertices and 25 edges such that each vertex of \(G\) has degree at least 3. Then the maximum possible value of \(n\) is ________.
Practise the full 2017-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Graph Theory (Connectivity, Paths, Cycles, Trees)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group