Graph energy centrality: a new centrality measurement based on graph energy to analyse social networks
by S. Mahadevi; Shyam S. Kamath; D. Pushparaj Shetty
International Journal of Web Engineering and Technology (IJWET), Vol. 17, No. 2, 2022

Abstract: Critical node identification, one of the key issues in social network analysis, is addressed in this article with the development of a new centrality metric termed graph energy centrality (GEC). The fundamental idea underlying this GEC measure is to give each vertex a centrality value based on the graph energy that results from vertex elimination. We show that the GEC of each vertex is asymptotically equal to two for cycle graphs and exactly equal to two for complete graphs. We further demonstrate that star graphs can be ranked using only two GEC values, whereas path graphs can be ranked using a maximum of values. The proposed algorithm takes O(n³) time complexity to rank all vertices; hence an optimised algorithm is also being proposed considering only a few classes of graphs. The proposed algorithm ranks the nodes based on the collaborative measure of eigenvalues.

Online publication date: Mon, 19-Sep-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web Engineering and Technology (IJWET):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com