Usage of Self-Organizing Map (SOM) for clustering vertices of any given graph. Simultaneously its input is observed and worked in terms of weight matrix, learning rate and final resultant matrix, which helps to form a cluster. The purpose of this paper is to introduce a procedure of SOM for clustering and observed impact corresponding to varied weight class for simple graph or vector matrix using Euclidean distance. A simple vector matrix problem is solved by using 2, 3 & 4 weight class matrix. By adopting a different weight matrix class with same vector matrix has presented a clustering and visualization.