0 votes 0 votes Anuj1995 asked Sep 21, 2018 Anuj1995 386 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments srestha commented Sep 21, 2018 reply Follow Share 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 2 votes 2 votes Magma commented Sep 21, 2018 reply Follow Share please someone try this one ! https://gateoverflow.in/245440/graph-theory 0 votes 0 votes smsubham commented Sep 21, 2018 reply Follow Share @magma didn't get that question in the link. 0 votes 0 votes Please log in or register to add a comment.