To clearly understand how network structure and function interact is a basic difficulty in the study of large networked systems. An old-fashioned idea from graph theory, called articulation points, may be used to do this. In a network, a node If removing it causes the network to become disconnected or causes more network components to get linked, it is an articulation point (AP). Single points of collapse are represented as articulation points in networks. The major goal of this research is to provide a method for identifying the articulation points and centrality measures. We can locate the articulation points considerably more quickly and effectively by using TARJAN’S Algorithm, which uses depth-first search. It must fulfill two requirements to qualify as an articulation point. For the root node of a DFS traversal to be an articulation point, it must contain at least two offspring nodes that are members of various sub graphs. It has been discovered that articulation points (APS) are crucial for maintaining the reliability and connection of several real-world networks. By assigning each node in the graph a scalar value based on an assumption, centrality metrics may be used to quantify each node’s significance. A fundamental centrality metric is node degree. In terms of node neighbors, it is equivalent. Hence, the more neighbors a node has, the more central and densely linked it is, and the more it affects the network by having more neighbors.