week 6 Flashcards
1
Q
what is Handshaking theorem
A
no of edges = sum of degrees of vertices / 2
2
Q
In a directed graph if u ,v are connected by an edge what can we say
A
. u is adjacent to v
. u is the initial vertex
. v is the end(terminal ) vertex
. in degree of vertex v - no of edges with v as their terminal vertex
out degree of vertex v - no of edges with v as inital vertex
3
Q
how to calculate no of edges from in vertex
A
no of edges = sum of in degrees of vertices
no of edges = sum of out degrees of vertices
4
Q
A
5
Q
A
