Loading...

Loading, please wait...

Back to Topics

Network Analysis
Graph Theory

Practice questions from Graph Theory.

7
Total
0
Attempted
0%
0
Correct
0%
0
Incorrect
0%
Q#1 Graph Theory GATE EE 2018 (Set 1) MCQ +1 mark -0.33 marks

The graph of a network has 8 nodes and 5 independent loops. The number of branches of the graph is

11

12

13

14

Explanation Locked!

Unlock this branch to view the explanation, track, bookmark and more.

Sign in to Unlock
Q#2 Graph Theory GATE EE 2016 (Set 2) MCQ +1 mark -0.33 marks

The graph associated with an electrical has 7 branches and 5 nodes. The number of independent KCL equations and the number of independent KVL equations, respectively, are        

2 and 5  

5 and 2

3 and 4        

4 and 3

Explanation Locked!

Unlock this branch to view the explanation, track, bookmark and more.

Sign in to Unlock
Q#3 Graph Theory GATE EE 2008 (Set 1) MCQ +1 mark -0.33 marks

The number of chords in the graph of the given circuit will be  

Q1.jpg

3

4

5

6

Explanation Locked!

Unlock this branch to view the explanation, track, bookmark and more.

Sign in to Unlock
Q#4 Graph Theory GATE EE 2007 (Set 1) MCQ +2 marks -0.66 marks

The matrix A given below is the node incidence matrix of a network. The columns correspond to branches of the network while the rows correspond to nodes.  Let denote the vector of branch voltages while that of branch currents. The vector denotes the vector of node voltages relative to a common ground.

Which of the following statements is true?

The equations ,

are KVL equations for the network for some loops.

The equations ,

are KVL equations for the network for some loops.

E = AV

AV = 0 are KVL equations for the network.

Explanation Locked!

Unlock this branch to view the explanation, track, bookmark and more.

Sign in to Unlock
Q#5 Graph Theory GATE EE 2002 (Set 1) MCQ +1 mark -0.33 marks

The graph of an electrical network has N nodes and B branches. The number of links, L, with respect to the choice of a tree, is given by

B – N + 1         

B + N

N – B + 1         

N – 2B -1

Explanation Locked!

Unlock this branch to view the explanation, track, bookmark and more.

Sign in to Unlock
Q#6 Graph Theory GATE EE 2001 (Set 1) MCQ +2 marks -0.66 marks

A connected network of N > 2 nodes has at most one branch directly connecting any pair of nodes. The graph of the network

Must have at least N branches for one or more closed path to exist.

Can have any unlimited number of branches

Can only have at most N branches

Can have a minimum number of branches not decided by N

Explanation Locked!

Unlock this branch to view the explanation, track, bookmark and more.

Sign in to Unlock
Q#7 Graph Theory GATE EE 1994 (Set 1) MCQ +1 mark -0.33 marks

Figure shown a, d, c resistive network and its graph is drawn aside. A ‘proper tree’ chosen for analyzing the network will contain the edges.

D:\Vol-2\Network Analysis\Graph Theory-01.jpg D:\Vol-2\Network Analysis\Graph Theory-01,a.jpg

ab, bc, ad

ab, bc, ca

ab, bd, cd        

ac, bd, ad

Explanation Locked!

Unlock this branch to view the explanation, track, bookmark and more.

Sign in to Unlock