1 votes 1 votes A simple undirected graph ‘X’ has 10 vertices. If ‘X’ has 5 equally sized connected components, the maximum number of edges in graph ‘X’ is _________. shefali1 asked Jan 22, 2017 shefali1 613 views answer comment Share Follow See 1 comment See all 1 1 comment reply Pavan Kumar Munnam commented Jan 23, 2017 reply Follow Share https://gateoverflow.in/37274/max-number-of-edges 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes answer is 15? cse23 answered Jan 22, 2017 cse23 comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments mcjoshi commented Jan 24, 2017 reply Follow Share Graph has $10$ vertices and $5$ equal components(means equal vertices, equal edges), means each one contains $2$ vertices and correspond to $1$ edge. Thus $5$ edges in $5$ components. 1 votes 1 votes Sushant Gokhale commented Jan 24, 2017 reply Follow Share @mcjoshi. ohh...yeah. I took 2 edges(i.e a cycle) between 2 vertices. 5 is correct 1 votes 1 votes mohit chawla commented Jan 24, 2017 reply Follow Share yeah... skipped that "equally sized" word. 5 is correct ans. 0 votes 0 votes Please log in or register to add a comment.
