______ is the maximum number of edges in an acyclic undirected graph with k vertices.
(a) k-1
(b) k^2
(c) 2k+3
(d) k^3+4
The question was asked in homework.
My enquiry is from Complete and Connected Graphs topic in section Graphs of Discrete Mathematics