- First we will discussed some important definition and then we will learn how to make GRAPH from any given NETWORKS.
- GRAPH :- When all elements in the Network like Inductor, capacitor, Resistance etc. Are replaced by simple single line with small circle at both the ends then this type of configuration is called as a GRAPH.
- NODE OR VERTICES :- Node is defined as the intersection of two or more branches at one common point is called as a NODE OR VERTICES.
- BRANCH :- Branch of network is defined as a line which represents one Network element or combination of elements connected between two common point.
- DEGREE OF NODE :- Degree of node is defined as the number of incoming branches across any node.
- COMPLETE GRAPH :- A graph in which only one line segment is connected between any node pair is referred as a COMPLETE GRAPH.
- NON CONNECTED GRAPH OR UN CONNECTED GRAPH :- A graph in which any node is isolated ( means no any branch is connected between this node) is known as a Non connected or un connected graph.
- ORIENTED GRAPH :- A graph in which direction of current is indicated in all the branches then it's called as a ORIENTED GRAPH.
- NON ORIENTED GRAPH :- A graph in which the direction of current is not indicated then it's know as a NON ORIENTED GRAPH.
❋Now we take one example and learn how to draw GRAPH of any random given NETWORKS.
Superb derive concept of network topology 👍👍
ReplyDelete