Loading...

Loading, please wait...

ExamDost
Learning Portal

Practice over 1000+ GATE-level questions from this topic!

Designed to match the latest GATE pattern with topic-wise precision, difficulty tagging, and detailed solutions.

Q#1 Graph Theory GATE EE 2001 MCQ +2 marks -0.66 marks

A connected network of N > 2 nodes has at most one branch directly connecting any pair of nodes. The graph of the network

Must have at least N branches for one or more closed path to exist.

Can have any unlimited number of branches

Can only have at most N branches

Can have a minimum number of branches not decided by N

Explanation Locked!

Unlock this branch to view the explanation, track, bookmark and more.

Sign in to Unlock
Browse Practice Questions by Chapters / Topics in Browse Practice Questions by Chapters / Topics in GATE Electrical Engineering
Total Questions

Attempted

% Attempted

Correct

% Correct

Topic Questions Attempted Correct
Network Analysis 259 0 0
Signals and Systems 164 0 0
Control Systems 201 0 0
Analog Electronics 180 0 0
Digital Electronics 148 0 0
Electrical Machines 390 0 0
Power Electronics 237 0 0
Power Systems 343 0 0
EMFT EE 9 0 0
Measurement 152 0 0
Engineering Mathematics 225 0 0
General Aptitude 206 0 0