Netuork GrasbTheory
means
ot8vra ph thecry pro
vole. a 3ystemactic
The eebniques me thedolog ies
and oop euattons and
mode eqms.
ofwwiting nearly-independent
ave parttularly useful in som
puter-aud -
analysu of very ae elecmt
eleetronic eircuits.
a.bleto lot of m e eonceþBs and defnitions
To bePly the methods , a whole
are to be studled s hich aye asjo louos
Cu
1.Grah 9f each mode of the gloe
2
vepyesentee as a Vertex
ctruit s
R2
(node)
and 2ach element R,L,C
C ) 5
Vor I) s Tebresented by a
ne Seq mente then he resulHtng
Tesres entailon is called a qraph
4
Tbus, rabh
G
is a 8et containî oq b2 M2 b m3
all branches and vrties (nodes)
b5
the etcuit
of aiven
G= Mi, n2, m3,
n4 ; bi, b2,b3, b4,b5,
Grah given ciruib
2. Subaraph A ubgraph of the aph a
subset of set G n2
bu, bs,bé n b2
G Set ni,n2,n3,n4; b1,ba, ba,
i , na,b , ba,b6}
then Subset
s asubgraph of G
b
n2
bsetni,n2, ne, ny, by ba,bg bs
G'
anci hey subgraþh of
3. Connected arath a conneeted grapb one in which here at least
Oneath betueen euery pair of node s
(vertiea.
Crapb G
G Con nected graph
mot conneeted (drsjolnt) Con nected arakn
Ga
s+has two unconneeted
e arts
Graleh G2
disjoint arakh
4. Plana and nonplanar grahs
A planar graph is on ohch Non-planar
Gvaen
Can be draon on a lane (oY
a sheet of papev) wthout any
branches intersecting cach othey. L5
Other wise , ts nn-blanay A non-planar
graph is shoton In Fig.
R2
OTiented Graph w hen the
C
bTanches ave ass tqmed an 'oren toatidn
(direchon) n accaydlance ith the
as sumed diYections of Curent S
bs
n +he
m3
it is
Var ous bYanches othe given curuut,
b o2
Called an OTtented qrash.
be
oriented araph
AbPanch satd to be incideat to a node f t s
GIncidence
Conneeted to that node. Ang gten
ranch can be intident to only
oo noees. r example branch b
L intident to nodes i and a s shouon.
1
7. Degree avertex degre
avetex the nunbey
branchesalso callecd
node
edges) ina det on a .
3
Thus, degree n=
Lhik egree
Tledes mi , n3, na =
n3
8. Path': A path behaan teo
VaTttes
adgs (branches)
Scqente
berween mi and such that
thYaugh
Verttus and edg aPpearing From , na, n3t na
all distinct. branches b bz, b6, a path
in this ath av
ane n3 aYe
and m are called ternminal vtits hile T2
Internal vevitces
vertices ae
Lhile all inter nal
Tenninal vertises are of oleqree
degree 2
Vertites and i aTe same
A closed paih in ohich e rmi nal
s called a
reutloep)
. Tyee a g7aph
2 2 n3
A trae T' a q7aph G
eonneeted subgrash of G,
toclucde all nedes of G bu
Lonteh
but loes not form a oop (eiruit).
G as sheuon can GralphG'
A ven gYaph
Some ae
howe manyt yees
m2 b2m3
n
shouonhere
b n2 b2 m3
G.
araeh
A 4ree o
(a)
b5
n3
D 6- a 2
(6) /b6
Some other
trees of
+he same
draph G
b5
b2
n3
M b2
na .M3
(4)
OY
The branches Incuded in the tyee ar ealleo rtyee branc hes
included in the Yce
ohile the branches not
Some
t mes, ust branches) ,
doted Ynes). Links are also called ehovds.
are called "Lenks (shown by
branches wheye N = total numbev of m od es
Evev tree has cxactlyN-) ,
CUertrces)
B b total number of branches/edges , then is
.9f B-(N-) (B-N+)
numer of Pinks =
=
malrix.
total here A incidence
Total number of Trees oß any graphdet {[AI[Al
the chosen tvee called
0 Cotree The Conplmentary sub-gyaph of
all Renks (chovd«')
aeotree and the edges of Co-tree are
n3 o2 3
nu
Graph 'C Tree T
m3
.'
Co-tree L
1 Augmented Intidence matrix: Aa
b
kcL to all medes
Apptng b 2
We can wYLfe
b b tb5=O bH
-1b+1b2 + lbg = 4
-
2 g -bg =o Aacalled
bbalbg CVuCmen tecl
matrix
încidence
and its
These can be oriHen in matrix torm oveler is NxB.
b2 b b6 Addtng
-1
-1 O
O
ib O++
T2 ib2
b3-byib(=0
iba
b
b5 b4-ibg+ibe=o
KC in matrix
cbtained
fan:Aaib
4re not
0 indpendent
neary
A obtained by
Havetver eqna tions adding +@+
OYiented NB matrix
s a
ro
ang given gph G Aa can be ormulated
whose element ,the follouoin Tuks apply -
node ands
brancb is Incident 4o ith
aL=+1 if
Hhe Lth node
lireeded aLway rom
and
branch s incident to 1th node
divected oLoards the th node
to i Th node
branch not ineident
= O if th
propertfes
inerdence matriy LAa has the ollouoing
he augmented
entry and
One1 2nbr
Sn each Colamn there is nly one +
Sum o each column s zero
Sum of al Tos oAal=o
be deletee
oithaut any lass of inovmation.
Ag Tow ofAa can
Recuced Incidence matrix (oY Simply *incidence matrix A
12.
mode olatum node ) dele4ed,
J7 the 7o corYes jpmding to refetence
scalled Teduted incidence matrix oY simply inadence matrix LA
then
ifwe echoose n4 a3 Yeferenee node,
buS, in the evious 2xamble
as
delerinqthe last You Coneapon di'ng to nu) 3vesA
n
ib2
02-
ib
O -1 bs
b6
Jn matrls Herm: [A]i = givestnearlyndependent node eqs.
A,Doleninadon otol umy of lvoe
lA -
4 33
AISA=
etonmi ymn 3-+ 4a}
24 - 4 6
aph shoud haue 1 rees!
4. A fossi ble 4rees ofthe of ang graph det [AILA
gYalph Totalno o trees =
. .. .*
15 Re kaution between node votages and
bYanch voltages
bi m2 03
b 2
by b3 b6
n n2
Dn2 Vn3
Vn VnH
-On
n-Un3
b6 Dnu4-Vn3
Vba Vn2
Nm3
VE4
Vn
Vb6
Same as Aa
16 Tellegans Theoyem:
of both sides
Takingrans ponse
- 'TA
b2
ib3
Ncw multtplying boh sldes by ibuhere ib4
ib5
trom KcL in matrx farm
in matmx tor
Hence ' [o This s Tellec ans theoTem
e. b lby + Vbz2 lba t. ..+bg lb*0
ib3 0
b K
ib l-e algebraie sum of instand aneous pouoes
B branehes of oa netooak = 0
in all the
