Open AccessBetweenness centrality in corona product of Path and Star graphs
Author(s) -
T. I. Haryadi,
Liliek Susilowati
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1731/1/012028
Subject(s) - betweenness centrality , centrality , shortest path problem , computer science , graph , star (game theory) , path (computing) , graph theory , theoretical computer science , combinatorics , mathematics , physics , computer network , astrophysics
Betweenness centrality is a concept in graph theory which is currently widely used in network analysis. The network can be a computer network, a criminal network, social interaction network, etc. The concept of betweenness centrality studies the potential ability of a point to exert influence on a network. If there is a point x in the shortest path between two points, then point x has the potential to influence information passing through that path. This paper will investigate the concept of betweenness centrality in the corona operation between path and star graph. Corona operation is one of the operations on graph theory that works between two graphs. The corona operation will duplicate the second graph and connect each copy to the first graph.