Newman [1]} proposed a clustering algorithm that is based on modularity optimisation. The algorithm starts with estimating the bisection of a graph \(G\) , generating the highest modularity \(m\)  from (REF ), that can be rewritten as follows:
\(m = \frac{1}{4L}y^{T}\cdot M \cdot y,\) 
