The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
75 views
The maximum number of edges in an acyclic undirected graph with n vertices

A) n - 1

B) n

C) n +1

D) 2n -1
closed as a duplicate of: GATE2004-IT-5
asked in DS by Veteran (11.7k points)
closed by | 75 views


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

29,138 questions
36,958 answers
92,024 comments
34,802 users