Scribd
Upload
2 views7 pages

Definitions

The document defines key concepts related to network theory, including network, topology, circuit, branch, node, graph, and sub-graph. It explains the characteristics of connected and unconnected graphs, paths, loops, planar and non-planar graphs, and oriented graphs. Additionally, it covers the properties of trees and incidence matrices, including complete and reduced incidence matrices, and their significance in representing the relationships between branches and nodes in a graph.

Uploaded by

thanmai369
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views7 pages

Definitions

The document defines key concepts related to network theory, including network, topology, circuit, branch, node, graph, and sub-graph. It explains the characteristics of connected and unconnected graphs, paths, loops, planar and non-planar graphs, and oriented graphs. Additionally, it covers the properties of trees and incidence matrices, including complete and reduced incidence matrices, and their significance in representing the relationships between branches and nodes in a graph.

Uploaded by

thanmai369
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Network: A combination of two or more network elements is called a network.

Topology: Topology is a branch of geometry which is concerned with the properties of a


geometrical figure, which are not changed when the figure is physically distorted, provided that,
no parts of the figure are cut open or joined together.
Circuit: If the network has at least one closed path it is a circuit. Note that every circuit is a
network but every network is not a circuit.
Branch: Representation of each element (component) of a electric network by a line segment is
a branch.
Node: A point at which two or more elements are joined is a node. End points of the branches
are called nodes.
Graph: It is collection of branches and nodes in which each branch connects two nodes.
Graph of a Network: The diagram that gives network geometry and uses lines with dots at the
ends to represent network element is usually called a graph of a given network. For example

Sub-graph: A sub-graph is a subset of branches and nodes of a graph for example branches 1, 2,
3 & 4 forms a sub-graph. The sub-graph may be connected or unconnected. The sub- graph of
graph shown in figure 2 is shown in figure 3.
Connected Graph: If there exists at least one path from each node to every other node, then
graph is said to be connected. Example

Un-connected Graph: If there exists no path from each node to every other node, the graph is
said to be un-connected graph. For example, the network containing a transformer (inductively
coupled parts) its graph could be un-connected.

Path: A sequence of branches going from one node to other is called path. The node once
considered should not be again considered the same node.
Loop (Closed Path): Loop may be defined as a connected sub-graph of a graph, which has
exactly two branches of the sub-graph connected to each of its node.
For example, the branches1, 2 & 3 in figure 7 constitute a loop.

Planar and Non-planar Graphs: A planar graph is one where the branches do not cross each
other while drawn on a plain sheet of paper. If they cross, they are non-planar.

Oriented Graph: The graph whose branches carry an orientation is called an oriented graph

Tree: Tree of a connected graph is defined as any set of branches, which together connect all the
nodes of the graph without forming any loops. The branches of a tree are called Twigs.
Co-tree: Remaining branches of a graph, which are not in the tree form a co-tree. The branches
of a co-tree are called links or chords. The tree and co-tree for a given oriented graph shown in
figure11 is shown in figure12 and figure13.
Properties of Tree:
i) It contains all the nodes of the graph.
ii) It contains (nt-1) branches. Where ‘nt’ is total number of nodes in the given graph.
iii) There are no closed paths. Total number of tree branches, n = (nt-1) Where nt = Total number
of nodes Total number of links, l = (b-n) Where b = Total number of branches in the graph.
Degree of Node: The number of branches attached to the node is degree of node.
Complete Incidence Matrix (Aa): Incidence matrix gives us the information about the
branches, which are joined to the nodes and the orientation of the branch, which may be towards
a node or away from it. Nodes of the graph form the rows and branches form the columns. If the
branch is not connected to node, corresponding element in the matrix is given the value ‘0’. If a
branch is joined, it has two possible orientations. If the orientation is away from the node, the
corresponding matrix element is written as ‘+1’. If it is towards the node, the corresponding
matrix element is written as ‘-1’.
Example: 1) Obtain complete incidence matrix for the graph shown

Properties of Incidence Matrix:


i)Each column has only two non-zero elements and all other elements are zero.
ii) If all the rows of ‘Aa’ are added, the sum will be a row whose elements equal zero. If the
graph has ‘b’ branches and ‘nt’ nodes, the complete incidence matrix is of the order (nt x b).
Reduced Incidence Matrix (A):
When one row is eliminated from the complete incidence matrix, the remaining matrix is called
reduced incidence matrix If the graph has ‘b’ branches and ‘nt’ nodes, the reduced incidence
matrix is of the order (nt-1) x b.
Example: 2) Write the complete and reduced incidence matrix for the given graph shown

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy