Users Also Read
MCQ's Search Engine
Electrical Engineering
Mechanical Engineering
Civil Engineering
Automobile Engineering
Chemical Engineering
Computer Engineering
Electronics Engineering
Medical Science Engg
A connected network of N > 2 nodes has at most one branch directly connecting any pair of nodes. The graph of the network | |
A. | must have at least N branches for one or more closed paths to exist? [Correct Answer] |
B. | can have an unlimited number of branches? [Wrong Answer] |
C. | can only have at most N branches? [Wrong Answer] |
D. | can have a minimum number of branches not decided by N? [Wrong Answer] |