본문 바로가기
  • Home

Analysis of the network robustness based on the centrality of vertices in the graph

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2017, 22(3), pp.61-67
  • DOI : 10.9708/jksci.2017.22.03.061
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science
  • Received : December 28, 2016
  • Accepted : March 3, 2017
  • Published : March 31, 2017

ChangKwon Jeong 1 Chi-Geun Han 1 Sang-Hoon Lee 1

1경희대학교

Accredited

ABSTRACT

This paper analyzes the robustness of the network based on the centrality of vertices in the graph. In this paper, a random graph is generated and a modified graph is constructed by adding or removing vertices or edges in the generated random graph. And then we analyze the robustness of the graph by observing changes in the centrality of the random graph and the modified graph. In the process modifying a graph, we changes some parts of the graph, which has high values of centralities, not in the whole. We study how these additional changes affect the robustness of the graph when changes occurring a group that has higher centralities than in the whole.

Citation status

* References for papers published after 2022 are currently being built.