Max number of edges in undirected graph here K10 have 9 degree so if remove one vertex we have to remove 9 edges so 45-9=36; OR [K10 - (degree of K10) ] = disconnected component with max edges. The vertex set of G is {(i, j)} 1 ≤ i ≤ 12 , 1 ≤ j ≤ 12 ) . For a simple graph with 4 vertices, the maximum number of edges Jul 25, 2023 ยท The algorithm to remove the maximum number of edges from an undirected graph that still leaves every vertex connected to another by an edge but can leave the resulting graph with vertices that cannot be reached from every other vertex would be. It is because maximum number of edges with n vertices is n(n-1)/2. The Task for this problem is to find the minimum and maximum number of connected components in the given graph if it is allowed to add an edge between any two nodes from N nodes as long as each node has a degree at most 2 in the graph. Therefore our disconnected graph will have only two partions because as number of partition increases number of edges will decrease. ie, degree=n-1. e. Here 45 will be max edges; Now we know, to disconnect a graph we need to remove edeges. A simple undirected graph ‘X’ has 10 vertices. jqmyzx pfcs lgdmf qbfjp xqsjqr besi odav krkurnoag hfjxg imce