1 votes 1 votes Degree of each vertex in $K_n$ is $n$ $n-1$ $n-2$ $2n-1$ Graph Theory nielit2016mar-scientistc discrete-mathematics graph-theory + – admin asked Apr 2, 2020 recategorized Oct 23, 2020 by Krithiga2101 admin 506 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes Kn is complete graph and in complete graph always there exist a direct edge between any two nodes. option B will be correct Vipin Tiwari answered Apr 3, 2020 Vipin Tiwari comment Share Follow See all 0 reply Please log in or register to add a comment.