Tree and Co-Tree MCQ’s

This set of Network Theory Multiple Choice Questions & Answers (MCQs) focuses on “Tree and Co-Tree”.

1. The number of branches incident at the node of a graph is called?
a) degree of the node
b) order of the node
c) status of the node
d) number of the node

2. If no two branches of the graph cross each other, then the graph is called?
a) directed graph
b) undirected graph
c) planar graph
d) non-planar graph

3. A graph is said to be a directed graph if ________ of the graph has direction.
a) 1 branch
b) 2 branches
c) 3 branches
d) every branch

4. Consider the graph given below. Which of the following is a not a tree to the graph?

a)

b)

c)

d)

5. Loops which contain only one link are independent are called?
a) open loops
b) closed loops
c) basic loops
d) none of the mentioned

6. If A represents incidence matrix, I represents branch current vectors, then?
a) AI = 1
b) AI = 0
c) AI = 2
d) AI= 3

7. Number of twigs in a tree are? (where, n-number of nodes)
a) n
b) n+1
c) n-1
d) n-2

8. If the incident matrix of a graph is given below. The corresponding graph is?

```     a    b   c   d   e   f
1   +1   0  +1   0   0   +1
2   -1  -1   0  +1   0    0
3    0  +1   0   0   +1  -1
4    0   0  -1  -1   -1   0```

a)

b)

c)

d)