N be the number of nodes and m be number of edges in a graph

N be the number of nodes and m be number of edges in a graph.
The number of edges in any undirected connected graph is at least
Select one:
a) n
b) n-1
c) None of the above
d) n(n-1)/2
  • Interview Candidate
  • 8
  • 4002

Showing Answers 1 - 8 of 8 Answers

Usha

  • Jun 7th, 2015
 

B) N-1

  Was this answer useful?  Yes

Ajitha

  • Jun 14th, 2015
 

d) n(n-1)/2

  Was this answer useful?  Yes

SHABNAM

  • Mar 24th, 2016
 

n-1

  Was this answer useful?  Yes

Jenny

  • May 9th, 2017
 

n-1

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions