GATE CS 2017 (Forenoon) — Question 20

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

Let \(T\) be a tree with 10 vertices. The sum of the degrees of all the vertices in \(T\) is ________.
Practise the full 2017-FN 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