in Graph Theory recategorized by
503 views
1 vote
1 vote

Degree of each vertex in $K_n$ is 

  1. $n$
  2. $n-1$
  3. $n-2$
  4. $2n-1$
in Graph Theory recategorized by
by
503 views

1 Answer

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
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true