Write a program in to find the largest value of k

Write a program in to find the largest value of k

Write a program in to find the largest value of k such that there exists a k-core in a given undirected graph G = (V, E). Also print out the nodes in the largest k-core.1. Let G = (V, E) be an undirected (unweighted) graph and let S = (C1, C2,……..Cl) be a community structure of G with I communities. Let A be the adjacency matrix of G, i.e., Aij =1 if (f,f) ? E and Aij = Or otherwise. Prove that the following two formulas to compute modularity of S are equivalent

2387_Graph.png

where E(Ct) is the number of edges