Graph clustering is one of the key techniques to understand the structures present in the graph data. In addition to clusters detection, the identification of hubs and outliers is also a critical task as it plays an important role in the analysis of graph data. In this paper, we propose DSCAN, a novel distributed graph clustering algorithm based on the structural clustering algorithms.