week 6

Question 1

what is Handshaking theorem

Answer 1

no of edges = sum of degrees of vertices / 2

Question 2

In a directed graph if u ,v are connected by an edge what can we say

Answer 2

. 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

Question 3

how to calculate no of edges from in vertex

Answer 3

no of edges = sum of in degrees of vertices
no of edges = sum of out degrees of vertices