• GRAPH CLUSTERING: A LINEAR ALGORITHM, THE CLUSTERS OF THE GIVEN GRAPH HAVE BEEN FORMED BASED ON THE LIMIT WE SPECIFIED AT THE BEGINNING

Abstract

A graph G is a pair of sets G (V, E), V is the set of vertices and the number of vertices n=|n| is the order of the graph. The set E contain the edge of the graph. Here we present a linear graph clustering algorithm the clusters of the given graph have been formed based on the limit we specified at the beginning. Limit specifies the number of adjacent vertices we include in one cluster.