ALE6113

Circuit Theory
Trimester March 2024

Chapter 3
Network Analysis
In this part, the following topics will be discussed:
 Definitions of nodes, branches, loops, and meshes
 Topological Graph
 Topological Graph - Tree
 Planar and nonplanar circuit
 An electric circuit can be defined as the interconnection of
various elements (R, L, C, V, I) so as to enable current flow. It
can be closed or open.
 Elements in an electric circuit can be interconnected in various
possible ways and topologies.
 This interconnection of the circuit elements is described in
terms on nodes, branches, loops and meshes.
 A point of connection between two or more branches.
 A node is usually indicated by a dot (  ) in a circuit.
 If a short circuit connects 2 nodes, then they constitute a single
node.

Eg:
a, b, c, d, e, f, g
 It is a node joining three or more circuit elements
(branches).
 Only essential nodes are taken into account for circuit analysis.

 b, c, e, and g are essential nodes.

 A branch represents any single element such as a R, L, C, V,
or I.
 Or a path that connects two nodes.

Eg:
a-c (E1) a-b (R1)
c-f (E2) c-d (R2)
b-g (I) d-e (R3)
f-g (R4)
b-e (R5)
e-g (R6)
b-g (R7)
 It is defined as a path that connects two essential nodes
without passing through an essential node.

Eg:
c-a-b
c-f-g
c-d-e
 A loop is any closed path in a circuit.
 It is formed by starting at a node, passing through a set of
nodes, and returning to the starting node without passing
through any node more than once.

Eg:
c-a-b-e-d-c
c-d-e-g-f-c
b-g-e-b
a-b-e-g-f-c-a
 A mesh is a special type of loop that does not contain any
other loops within it.

Eg:
a-b-e-d-c-a
c-d-e-g-f-c

whereas, c-a-b-e-g-f-c is not a mesh but it is a loop because

there are two loops within it.
 A topological graph is defined as the collection of essential
branches and essential nodes.
 It is a diagram shows how the various elements in a network
are connected.
 It is represented graphically by drawing a dot for every node,
and drawing an arc (line) between two nodes if they are
connected by an element.
 In the drawing of topological graph, only essential nodes and
essential branches are considered.
There are four rules in drawing the graph:
• Voltage source becomes a short circuit.
• Current source becomes an open circuit.
• Element in parallel with voltage source is not a branch.
• Element in series with current source is not considered as
a branch.
 1 2 3 4
1 2 3 4

Eg: R2 R1 E
R2 I R1 E
4 I
4
R1 1 2
R1 1 2
1 2
1 2
4
4 1 2
1 2
1 2 1 2
RR2
2
11 22 RR1 33 44
1
LL1 RR2 LL2 RR1
1 2
2 1
11
11 22 33 44
11
Eg: L1
L1
L1
L1
R1 R2
R1 2R2 R1 R2
2
2
2
1 2 R1 32 R2 1 3
1 1 3 2 1 3 31 2 3
1 3 1 3
C L2
C L2 C L2
E C L2
E R3 E
R3 R3
E
R3 4
4 4 4
4 4 4
4
L1
L1 L1
L1 2
R1 C 1 2 3,5 2
R1 C2 R1 5 C3 1 1
3,5 2 3,5
1 2 5 23 5 3 1
1 1 R 1 C 3,5
2 5 3
1
I R2 L2 E
I R2 IL2 R2 E L2 E
R3 I R2 L2 E
R3 R3 4,6
4,6 4,6
R3 4,6
4 6
4 6 4 6
4 6
 A loop is a closed path formed by two or more branches of the
graph.
b

c e

Eg: c-b-e-c, c-b-g-c, etc.

 b
 A mesh is a special type of loop
that does not have a closed path in
c e its interior.

g Eg: c-e-g-c, b-g-e-b, c-b-e-c.

We can determine the number of meshes in a graph if we know

the number of nodes (n) and the number of branches (b),

Number of meshes (m) = b - n + 1

i.e. No. of branches (b) = 6; No. of nodes (n) = 4

 m = 6 – 4 + 1= 3
 A tree is defined as a sub graph of a graph that connects all
the nodes but contain no loops.

b b
b

c c e
c e e

g g g

Graph Trees
Example 3-1a
For the circuit shown below, draw the topological graph,
determine the number of essential nodes (b), the number of
essential branches (n) and the number of meshes (m). Also draw
the possible trees for the graph.
2 3

Branches: Nodes:
Meshes:
 2 3

Possible Trees
 A planar circuit is a network which can be drawn on a 2D
surface without a branch having to cross another branch. i.e.,
a network which can be drawn in a plane without any edge
crossings.

1
1 1

2
3 2
3

3 2
Planar circuit Planar graph
 A nonplanar network is a network which cannot be drawn on a
2D surface without branches being overlapped.
 They are broadly defined as those networks which allow
segments of the network to cross without a network node
being located at the intersection.
1, 2
1 2

4 5

4 5
3 6

3 6

Non-Planar circuit Non-Planar graph