17.13 SUMMARY
  • The study of topological properties of a network employing a branch of Mathematics called Linear Graph Theory is termed Network Topology.
  • An oriented linear graph is a collection of nodes and branches with branches interconnecting the nodes. A direction is assigned to each branch. The interconnection information for such a graph is contained in its all incidence matrix Aa. The rows of A correspond to the nodes and the columns of Aa correspond to the branches. The entry aij is +1, if the jth branch is incident at the ith node with its orientation away from the node; – 1, if the orientation is towards the node and 0 if the jth branch is not incident at the ith node.
  • Order of Aa is n X b, where n is the number of nodes and b is the ...

Get Electric Circuits and Networks now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.