Professional Documents
Culture Documents
EE304 - 20160819 GRPH Thry
EE304 - 20160819 GRPH Thry
EE304 - 20160819 GRPH Thry
Handout: # 01
vR = iR (1.1) + vR
Please note that vR and i are functions of Fig. 1.1: Electrical symbol and
time, if needed, we can emphsize this fact that current-voltage conventions for a
by writing vR (t) and i(t), instead. capacitor
- A Capacitor
The mathematical model of a real ideal capic-
itor is defined as C
i
dvC
i=C (1.2)
dt + vC
Also note that vC and i are functions of time, Fig. 1.2: Electrical symbol and
if needed, we can emphsize this fact that by current-voltage conventions for a
capacitor
writing vC (t) and i(t), instead.
- An Inductor
The mathematical model of an ideal inductor
is defined by a simple differential equation as L
i
di
vL = L (1.3) + vL
dt
Fig. 1.3: Electrical symbol and
Here vL and i are functions of time, if needed,
current-voltage conventions for an
we can emphsize this fact that by writing inductor
vL (t) and i(t), instead.
(b) Node:
i. A point at which two or more circuit elements have a common connection,
ii. The number of branches incident to a node is known as the degree of that node.
2060720-02#20160819LJS 1/8
L. Joyprakash Singh, PhD EE - 304 ENT August 19, 2016
(c) Branch:
i. A single path, containing one circuit element, which connnects one node to any
other node,
ii. Represented by a line in the graph.
(d) Path:
i. A set of elements that may be traversed in order without passing through the same
node twice.
(e) Loop:
i. A close path or a closed contour selected in a network/circuit,
ii. A path that may be started from a prticular node to other nodes through branches
and comes to the original/starting node,
iii. Also known as closed path or circuit.
(f) Mesh1 [2]:
i. A loop that does not contain any other loops within it,
ii. Any mesh is a circuit/loop but any loop/circuit may not be a mesh.
(g) Network:
i. The interconnection of two or more circuit elements forms an electical network.
(h) Circuit:
i. A Network that contains at least one closed path,
ii. Every circuit is a network, but not all networks are circuits.
(i) Planar circuit:
i. A circuit that may drawn on a plane surface in such a way that no branch passes
over or under any other branch.
(j) Topology:
i. Deals with properties of networks which are unaffected when the network is stretched,
twisted, or otherwise distorted the size and the shape,
ii. Not concerned with the particular types of elements appearing in the circuit, but
only with the way in which branches and nodes are arranged.
(k) Graph:
i. A graph corresponding to a given network is obtained by replacing all circuit ele-
ments with lines.
) Connected graph: A graph in which at least one path exists between any
two nodes of the graph. If the network has a transformer as one of the element,
then the resulted graph is unconnected
) Directed or Oriented graph: A graph that has all the nodes and branches
numbered and also directions are given to the branches.
) Subgraph: The subset of a graph. If the number of nodes and branches of a
subgraph is less than that of the graph, the subgraph is said to be proper.
Note: Circuits [closed paths] of a graph have the following properties
- The maximum number of branches possible, in any circuit/loop, will be equal to
the number of nodes or vertices.
- There are exactly two paths between any pair of vertices in a circuit.
- There are at least two branches in a circuit.
If the two terminal nodes of a path are made to coincide, the result will be a circuit or
loop.
1
Engineering Circuit Analysis, 8e
(l) Example - 01
IL L
R1 R2 2 2
IR1 2 IR2 1 3 1 3
1 3
Is IR3
IC
Vs + C R3
4 4 4
2
2
2
1 3
1 3
4
4
4
1 3
(a) A graph of (a). (b) Another graph of (a). (c) Another graph of (a).
(m) Example - 02
IL L
a a
R1 R2
I1 2 I2
1 3 b 2 c b 2 c
1 3 1 3
I3
R IC
d
5 C R3
Is e f d e f
5
Vs +
g
4 4 4, 5
Fig. 1.6: (a) A circuit, (b) its directed graph and (c) simplified directed graph of (b).
(n) Example - 03
IL L a
R1 R2 b 2 c a
I1 2 I2 1 3 1 3
1 3
b c
R IC
5 C Is d e d 2
Ivs
Vs +
e
4 4 4
Note:
- The active elements are excluded[replaced by their internal resistances] from the graph
to simplify analysis and computation.
(o) Example - 04
R1 R2
1 IR1 2 IR2 3 a 2 b
1 3
IR3 IR4
IC
5A R3 C R4 d e f
c
4 4
Note:
- If each of the line/branch in a given graph has a reference direction [as indicated by an
arrow mark], then the resulted graph is called an/a oriented/directed graph.
(p) Example - 05
1A 1V
+
1
1 1
1 1
Fig. 1.9: (a) A circuit, and its- (b) simplified graph and (c) directed graph.
Note:
- Where direction of flow of currents are not shown in the given circuit diagram, arbitrary
directions may be assigned in each branch before drawing the directed graph.
- When voltage source is not in series with any passive element in the given network, it is
kept in the graph as a branch.
- In the above graph, the current source is removed to reduce the brance in the graph for
simplicity. However, current sources are normally kept in the graph like voltage sources
during circuit analysis.
(q) Example - 06
C1 C1
4
R2 R2
2
2
1 3
R2 R2
RS C2
R1
RS RL
C2 RL 1 3
0
v1 + R1
C1 C1
Ref.node 4
(a) (b)
Fig. 1.10: (a) A circuit, and its- (b) simplified graph and (c) directed graph.
2 1 2
1 3
6 3
4
5 4
(a) (b)
IL L
R2 R3
I1 3 I2 4
2
Is 3
2 4
I3
IC
R1
C R4 Is
1
Vs +
5 1, 5
(a) (b)
R2 C
I2 2 3 IC 4 2 3
1 1 4
I3
R1 K
I1
R3 I
Vs +
6 5 6 5
(a) (b)
Example - 01:
IL L
a
R1 R2
I1 2 I2 b 2 c
1 3 1 3
I3
R IC
C R3 e f
Is d
Vs +
4 4
(a) A Circuit (b) The graph
a a a a
b 2 c b 2 c b 2 c b 2 c
1 3 1 3 1 3 1 3
d e f d e f d e f d e f
4 4 4 4
b 2 c b 2 c b 2 c b 2 c
1 3 1 3 1 3 1 3
d e f d e f d e f d e f
4 4 4 4
b 2 c b 2 c b 2 c b 2 c
1 3 1 3 1 3 1 3
d e f d e f d e f d e f
4 4 4 4
b 2 c b 2 c b 2 c b 2 c
1 3 1 3 1 3 1 3
d e f d e f d e f d e f
4 4 4 4
Example - 02:
8 15
1 2 3 1 2 3 1 2 3 1 2 3
+ vx
vx
100 V + 4
14
0 0 0 0
(a) Given circuit (b) Graph of (a) (c) A tree of (b) (d) Another tree of (b)
Example - 03:
2
2 2
+
vx 1S
2A
2S
+
1 3 1 3 1 3
Ref. node Ref. node
Ref. node
1V 2vx
1S
+
2S
vy
4vy
+
4 4 4
(a) Given circuit (b) The graph of (a) (c) A possible tree of (b)
Summary:
- A linear graph is defined as a collection of nodes and branches where nodes are
joined together by branches.
- A circuit elements is represented by lines in a graph and these lines are called
branches of the graph.
- Voltage and current sources may be represented by their internal impedances while
drawing a graph in which a voltage source would be assumed to be an ideal voltage
source and thus would be replaced by short circuit while current source [an ideal
current source] would be replaced by an open circuit to simplify the graph.
References
[1] M. E. Van Valkenburg, Network Analysis, 3/e, PHI, 2005.
[2] W. H. Hayt, J. E. Kemmerly, S. M. Durbin, Engineering Circuit Analysis, 8/e, MH, 2012.
[3] M. Nahvi, J. A. Edminister, Schuams Outline Electric Circuits, 4/e, TMH, SIE, 2007.
[4] D. Roy Choudhury, Networks and Systems, New Age Publishers, 1998.
[5] A. Sudhakar, S. S. Palli, Circuits and Networks: Analysis and Synthesis, 2/e, TMH, 2002.