Question

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

(a) N^N-1

(b) N^N

(c) N^N-2

(d) N^N+1

The question was posed to me by my college professor while I was bunking the class.

I need to ask this question from Cut-Set and Tree Branch Voltages topic in portion Methods of Analyzing Circuits of Network Theory

Answer 1

Right choice is (c) N^N-2

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