# If the graph of a network has n-nodes and b-branches then size of the incidence matrix is

1.  (n-1) x b

2.  n x (b-1)

3.  n x b

4.  (n-1) x (b-1)

4

n x b

Explanation :
No Explanation available for this question

# For an incidence matrix A, if branch j is incident to node i and directed away from it then aij is

1.  1

2.  0

3.  -1

4.  ∞

4

1

Explanation :
No Explanation available for this question

# For an incidence matrix A, if branch j is incident at node i and is oriented towards the node i then aij is

1.  1

2.  0

3.  -1

4.  ∞

4

-1

Explanation :
No Explanation available for this question

# For the incidence matrix A, if branch j is not incident on node i then aij is

1.  1

2.  0

3.  -1

4.  ∞

4

0

Explanation :
No Explanation available for this question

# If B is the incidence matrix and A is the reduced matrix, then number of possible trees of the graph is

1.

2.

3.

4.

4

Explanation :
No Explanation available for this question

# The sum of all the elements of a column of a complete incidence matrix is

1.  1

2.  0

3.  -1

4.  Can’t be calculated

4

0

Explanation :
No Explanation available for this question

# If n be number of nodes and b be number of branches in a graph, then rank of the incidence matrix is

1.  n

2.  n-1

3.  b

4.  b-1

4

n-1

Explanation :
No Explanation available for this question

# Two graphs which have same incidence matrix are said to be

1.  Isometric

2.  Isomorphic

3.  Polymorphic

4.  None of these

4

Isomorphic

Explanation :
No Explanation available for this question

# Those branches of the graph which are removed from the tree are called

1.  Twigs

3.  Loop

4.  Twig

4

Explanation :
No Explanation available for this question

1.  Branch

2.  Node

3.  Loop

4.  Twig

4