1 votes 1 votes Q . The maximum number of edges in an undirected graph (simple) with 52 vertices and 3 components are Graph Theory graph-theory + – kallu singh asked Aug 8, 2017 • recategorized Aug 8, 2017 by Tesla! kallu singh 1.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes $^{50}C_{2}$ And 3 components will be 2 single vertex making 2 components and 50 vertex complete graph making another component, 1225 edges will be there Tesla! answered Aug 8, 2017 Tesla! comment Share Follow See all 2 Comments See all 2 2 Comments reply saxena0612 commented Aug 8, 2017 reply Follow Share @Tesla please tell me what i am missing Considering it as complete graph total edge=52C2-2(for 3 components )? 0 votes 0 votes Tesla! commented Aug 8, 2017 reply Follow Share 52C2-2 won't have 3 components Take 5 vertex and 3 component and draw 5C2-2 resultant graph will be connected But separate it as 3C2 and 2 isolated vertex you will get maximum edges So for 52 vertex 50c2 + 2 isolated components will give max edges 1 votes 1 votes Please log in or register to add a comment.