Question discussion

What is the maximum number of edges possible in a simple, undirected, connected, acyclic graph (a tree) with V vertices?

570Medium DSSSB TGT Computer Science 0 replies 1 views

0

What is the maximum number of edges possible in a simple, undirected, connected, acyclic graph (a tree) with V vertices?

AV
BV-1
CV(V-1)/2
D2V

Correct answer: B

Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!