Ti-set matrix:-It is always possible to state which branches involve in the formation of loop of closed ckt for given oriented graph loop can be identified by making each loop with orientation of loop current by an arrow the element bhk loop matrix has following value.
(bhk=1)
if branch k is in loop h and its orientation co-inside with the orientation of loop.
(bhk=-1)
if branch k in loop h at and its orientation not inside with the orientation of loop.
(bhk=0)
If branch k is not a loop h.
For a given graph select any tree and remove its all links then replace each link one at a time, it is from closed path an loop the ckt formed by replacing each link from the tree are known as tiset matrix.
It is important select the orientation of F ckt co-inside with that of a link completing the F ckt.
#For a given graph with b branches and n nodes the possible of F ckt are given by [b-(n-1)] hence the no. Of the F-ckt equal to the no. of the link.
Consider tree of oriented graph shown in figh..
(bhk=1)
if branch k is in loop h and its orientation co-inside with the orientation of loop.
(bhk=-1)
if branch k in loop h at and its orientation not inside with the orientation of loop.
(bhk=0)
If branch k is not a loop h.
For a given graph select any tree and remove its all links then replace each link one at a time, it is from closed path an loop the ckt formed by replacing each link from the tree are known as tiset matrix.
It is important select the orientation of F ckt co-inside with that of a link completing the F ckt.
#For a given graph with b branches and n nodes the possible of F ckt are given by [b-(n-1)] hence the no. Of the F-ckt equal to the no. of the link.
Consider tree of oriented graph shown in figh..
- For the ckt shown in fig..
- Draw the oriented graph.
- Select a tree.
- Draw ti-set matrix also do...