We have too much data online in this modern world that is available to the public for some functionality or the other. This information is not misused by the general user but an adversary how wants to extract sensitive information and uses it against the user is definitely a problem in this social era. This information present online is not represented is not simple form like a tabular data but present in complex form as network graphs. The main objective of this research is to understand the problem of large graphs and provide a modified anonymized version of the original graph that holds the same structure and still anonymize to prevent information leakage. This is a huge task due to the complexity of graphs in large networks. This paper finds the problem that even though many algorithms are there for anonymity, it is still a difficult task to keep the adversary away. This work focus on partitioning the original graph based on modularity and then the edges are analysed and reconstruction of the anonymized graph takes place by modifying the edges present with the partitions such that the graph structure remains the same. The algorithm uses network hops to identify connectivity and modify the edges without losing the path. The nodes are not altered and no fake nodes or edges are added to maintain the structure. The anonymized graph can now be released and utilized. Till now work is done in edge modification and vertex modification has moved on to differential privacy leaving wide scope for the study on the problems in detail. This paper will showcase the entire graph modification with preservation of the structural properties. © BEIESP.