There are many graph abstraction methods that are existed as solutions for problems of graphs visualization. Visualization problems include edge crossings and node occlusions that hide the potential existed patterns. The aim of this research is to abstract graphs using one of network analysis metrics which is node betweenness centrality. Betweenness centrality is calculated for all graph nodes. Graph abstraction is done by removing the nodes with their attached edges such that they have betweenness centrality lower than a certain examined threshold. Experiments have been conducted and results show that the proposed abstraction method can effectively reduce the complexity of the graph visualization in term of node degree. Modularity of clusters after filtering is decreased but the final graph visualization is simpler and more informative.