Question

The number of tie set matrices formed from a graph is?

(a) N^N-1

(b) N^N

(c) N^N-2

(d) N^N+1

I have been asked this question by my college professor while I was bunking the class.

The question is from Link Currents: Tie-Set Matrix topic in section Methods of Analyzing Circuits of Network Theory

Answer 1

The correct option is (c) N^N-2

To elaborate: For every tree, there will be a unique tie set matrix. So there will be N^N-2 tie set matrices.