in Graph Theory retagged by
648 views
0 votes
0 votes

Maximum degree of any node in a simple graph with $n$ vertices is

  1. $n-1$
  2. $n$
  3. $n/2$
  4. $n-2$
in Graph Theory retagged by
by
648 views

1 comment

Maximum degree of any node in a simple graph with n  vertices is : n-1.

So A is the correct answer.
0
0

1 Answer

0 votes
0 votes
for a complete graph K4 max degree of vertices is 3   n-1
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