Network Theory: Graph Theory
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 0% Most missed: “A graph is said to be a directed graph if ________ of the graph has direction.”
Network Theory: Graph Theory
Time left 00:00
25 Questions

1. The number of tie set matrices formed from a graph are?
2. If no two branches of the graph cross each other, then the graph is called?
3. The direction of the cut-set is?
4. What would be an order of branch impedance matrix for the below stated KVL equilibrium equation on the basis of loop or mesh analysis? = B (Vs '
5. What will be the value of a rectangular (complete incidence) matrix, if an associated branch is oriented towards the node?
6. Which parameter should be essentially equal to the number of nodes in the network in accordance to the principle of duality?
7. According to the linear graph theory, the number of possible trees is always equal to the determinant of product of ______
8. How many fundamental cutsets will be generated for a graph with '
9. What will be the number of trees, if the graph exhibits reduction in the form of reduced incident matrix given below?
10. If a graph consists of 5 nodes, then the number of twigs in the tree are?
11. For Tie-set matrix, if the direction of current is same as loop current, then we place ___ in the matrix.
12. Number of twigs in a tree are? n- number of nodes
13. The number of cut set matrices formed from a graph is?
14. According to the graph theory of loop analysis, how many equilibrium equations are required at a minimum level in terms of number of branches (b) and number of nodes (n) in the graph?
15. The matrix formed by link branches of a tie set matrix is?
16. A graph is said to be a directed graph if ________ of the graph has direction.
17. The current in a closed path in a loop is called?
18. If A represents incidence matrix, I represents branch current vectors, then?
19. For every tree there will be _____ number of cut set matrices.
20. Loops which contain only one link are independent are called?
21. If there are 4 branches, 3 nodes then number of links in a co-tree are?
22. The loop current direction of the basic loop formed from the tree of the graph is?
23. For every tree there will be _____ number of cut set matrices.
24. The number of branches incident at the node of a graph is called?
25. For Tie-set matrix, if the direction of current is same as loop current, then we place ___ in the matrix.