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

ISHWAR BAIDARI*, AJITH HANAGWADIMATH

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.


Keywords


Graph, Cluster-Nodes, Limit, Cluster Edge, Cluster Connecting Edge.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2021 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter