Graph Theory

Question

Comments

yes,

for bipartite graph take $\left \lfloor \frac{n}{2} \right \rfloor,\left \lceil \frac{n}{2} \right \rceil$ for maximum edges

For disconnected graph $\binom{n-1}{2}$

and for connected graph it will be complete graph

---

please someone try this one !

https://gateoverflow.in/245440/graph-theory

---

@magma didn't get that question in the link.