Question

Consider the graph shown below. If a tree of the graph has branches 4, 5, 6, then one of the links will be?

(a) 3

(b) 4

(c) 5

(d) 6

I had been asked this question in an international level competition.

My question comes from Link Currents: Tie-Set Matrix in division Methods of Analyzing Circuits of Network Theory

Answer 1

The correct answer is (a) 3

Explanation: The branches of the co-tree are called links. So the links will be 1, 2, 3. For a given tree of a graph addition of each link between any two nodes form a loop called fundamental loop.