Electric Circuits and Networks

17.14 PROBLEMS

1. The reduced incidence matrix A of an oriented graph is given below. Verify whether the following sets of branches can constitute trees for this graph without drawing the graph. (i) {1, 6, 7, 8} (ii) {1, 3, 4, 6} (iii) {2, 3, 4, 5}

    

   

    

2. Draw the graph represented by the A matrix given in Problem-1.
3. Select a tree in the graph with A matrix given in Problem-1 such that all twigs of the tree are incident at one node. Obtain the path matrix for this tree and find A_t^‒1.
4. A graph with its incidence matrix as given in Problem-1 is the graph of an electrical network. The branches constituting the outer loop are independent current source ...