Marks 1
1
In the following graph, the number of trees (P) and the number of cut-sets (Q)
are

GATE ECE 2008
2
The minimum number of equations required to analyze the circuit shown in Fig.


GATE ECE 2003
3
Identify which of the following is NOT a true of the graph shown in Fig.

GATE ECE 1999
4
A network has 7 nodes and 5 independent loops. The number of branches in the
network is
GATE ECE 1998
5
The number of independent loops for a network with n nodes and b branches is
GATE ECE 1996