ItemConference Paper

Complex Network Articulation Points Detection and Centrality Measures

Title
Complex Network Articulation Points Detection and Centrality Measures
Creator
Prasad, D. Durga; J, Vijay Arputharaj; Rao, Kuncham Sreenivasa; Kumar, D. Vijaya; Kumar, J. Doondi; Reddy, K. V. Subba Rami
Description
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 TARJANS 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 nodes 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. ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2025.
Source
Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST;Volume;599 LNICST;pp.447-463
Date
01-01-2025
Publisher
Springer Science and Business Media Deutschland GmbH
Subject
Articulation Points; Betweenness Centrality; Centrality; Complex networks; Degree Centrality; Depth-First Search; Graph Theory; Node; TARJANs Algorithm
Coverage
Prasad D.D., Department of ECE, Vishnu Institute of Technology, Andhra Pradesh, Bhimavaram, India; J V.A., Department of Computer Science, CHRIST University, Karnataka, Bangalore, India; Rao K.S., Department of Computer Science and Engineering, Faculty of Science and Technology (IcfaiTech), ICFAI Foundation for Higher Education, Hyderabad, India; Kumar D.V., Freshman Engineering Department, Lakireddy Bali Reddy College of Engineering, Andhra Pradesh, Mylavaram, India; Kumar J.D., Department of ECE, Vishnu Institute of Technology, Andhra Pradesh, Bhimavaram, India; Reddy K.V.S.R., Department of ECE, Vishnu Institute of Technology, Andhra Pradesh, Bhimavaram, India
Rights
Restricted Access; Hardcopy may be available in the library
Relation
ISSN: 18678211; ISBN: 978-303177080-7;
Format
online
Language
English
Type
Conference paper

Citation

Prasad, D. Durga; J, Vijay Arputharaj; Rao, Kuncham Sreenivasa; Kumar, D. Vijaya; Kumar, J. Doondi; Reddy, K. V. Subba Rami, “Complex Network Articulation Points Detection and Centrality Measures,” CHRIST (Deemed To Be University) Institutional Repository, accessed June 20, 2026, https://archives.christuniversity.in/items/show/25304.

Output Formats