Loading previous year questions
Engineering Mathematics · Graph Theory
Official IIT answer key · IIT Delhi · Audited Aug 2026
GATE CSE 2012 Q17 · MCQ · 1 mark
Key concept
No account needed
Sit 5 related Graph TheoryPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
In GATE CS, graph theory under Engineering Mathematics emphasizes structural properties, algebraic relationships, and topological invariants of simple undirected graphs. Questions frequently evaluate planar graph relationships using Euler's formula, chromatic numbers and edge coloring bounds (Vizing's theorem, independent set bounds), and degree-based properties (Handshaking lemma, Havel-Hakimi theorem). The focus has steadily migrated from direct formula applications to structural reasoning and algebraic characterizations such as matrix powers.
Full Graph Theory guide →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
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.