6iraph Theoy:Collection ef Nodesl
branches.
) (OPassive element (RsL)
l,Indaperdt volteg
SouTce SC
w
Lndepandert urent
7
Source 0.c
66
No of bYonches in the
is enal or less
grapho A
2
than the no ot a
4t bYanches in the 3
cKt99
d
Nodes Jvertices - a 4 (a,b, C,d)
# Voltag surtes.
Bianches Eàges ’ 6 (1,2,3, 4, 5, 4) fdent (onsdes
as a biamehy
It the disection is not given thenthe gTaph is calleq undirechd
If the di ection is given then the graph is (alled direted
graphets
Rank of graph = n- 1
.where n no ot nodes
=4-1
’ Degfee ot nodes ’
Number ot incoming bionches to a node
Dla] = o ’ NO in Comnay. DC] -3
DLb] =9’2 in Cotaing Da] 1
,*2 Degee of nodes = NO of branches = 6
(omplete groph: 6me
Complete graph consists only one ine sogment ory branih
fo every node Pair.
C
node puY = ab b Co bdo cd,ac
1b 1b 1b Jb Jb
B b
Everg node pair has onky one line saqtnant | branch
-’InComplete gTap, because no
Segment c0nnets the ac veri us
’ Intomplete graph because C.d
Vevtices have two brAnhes.
No of branches in Complete groph B= nc, n!
2! (n-2))
66,
bb we can't ind tne nombe of bandhe n(n-)
in imComplete graph
, #Suppose a graph hos 66 brandhes then tne ind th nuker
of verices
So, 66x2 n n
n12n+|n -132=o
) n(n-12) +u(h-12) 20
n-12) (n+)0 d a e
Nodes [vertices =12
Connected Grraph:
In cometed graph all nodes p air Consists atleast pne
Une
Segment. May be 2 Segments r more segmets (an be
Conneted.
Connected graph
ok Isolated node
non-connected g raph
branches.
) (OPassive element (RsL)
l,Indaperdt volteg
SouTce SC
w
Lndepandert urent
7
Source 0.c
66
No of bYonches in the
is enal or less
grapho A
2
than the no ot a
4t bYanches in the 3
cKt99
d
Nodes Jvertices - a 4 (a,b, C,d)
# Voltag surtes.
Bianches Eàges ’ 6 (1,2,3, 4, 5, 4) fdent (onsdes
as a biamehy
It the disection is not given thenthe gTaph is calleq undirechd
If the di ection is given then the graph is (alled direted
graphets
Rank of graph = n- 1
.where n no ot nodes
=4-1
’ Degfee ot nodes ’
Number ot incoming bionches to a node
Dla] = o ’ NO in Comnay. DC] -3
DLb] =9’2 in Cotaing Da] 1
,*2 Degee of nodes = NO of branches = 6
(omplete groph: 6me
Complete graph consists only one ine sogment ory branih
fo every node Pair.
C
node puY = ab b Co bdo cd,ac
1b 1b 1b Jb Jb
B b
Everg node pair has onky one line saqtnant | branch
-’InComplete gTap, because no
Segment c0nnets the ac veri us
’ Intomplete graph because C.d
Vevtices have two brAnhes.
No of branches in Complete groph B= nc, n!
2! (n-2))
66,
bb we can't ind tne nombe of bandhe n(n-)
in imComplete graph
, #Suppose a graph hos 66 brandhes then tne ind th nuker
of verices
So, 66x2 n n
n12n+|n -132=o
) n(n-12) +u(h-12) 20
n-12) (n+)0 d a e
Nodes [vertices =12
Connected Grraph:
In cometed graph all nodes p air Consists atleast pne
Une
Segment. May be 2 Segments r more segmets (an be
Conneted.
Connected graph
ok Isolated node
non-connected g raph
