TY  - JOUR
T1  - Betweenness centrality in convex amalgamation of graphs
AU  - Kumar Raghavan Unnithan, Sunil
AU  - Balakrishnan, Kannan
PY  - 2019
DA  - January
DO  - 10.13069/jacodesmath.508983
JF  - Journal of Algebra Combinatorics Discrete Structures and Applications
PB  - iPeak Academy
WT  - DergiPark
SN  - 2148-838X
SP  - 21
EP  - 38
VL  - 6
IS  - 1
LA  - en
AB  - Betweenness centrality measures the potential or power of a node to control the communication over the network under the assumption that information flows primarily over the shortestpaths between pair of nodes. The removal of a node with highest betweenness from the networkwill most disrupt communications between other nodes because it lies on the largest numberof paths. A large network can be thought of as inter-connection between smaller networks bymeans of different graph operations. Thus the structure of a composite graph can be studied byanalysing its component graphs. In this paper we present the betweenness centrality of someclasses of composite graphs constructed by the graph operation called amalgamation or merging.
KW  - Betweenness centrality
KW  - Central vertex
KW  - Extreme vertex
KW  - Convex subgraph
KW  - Vertex amalgamation
KW  - Edge amalgamation
KW  - Path amalgamation
KW  - Subgraph 	amalgamation
CR  - [1] A. Bavelas, A mathematical model for group structures, Human Organization 7, Appl. Anthropol.
7(3) (1948) 16–30.
CR  - [2] U. Brandes, A faster algorithm for betweenness centrality, J. Math. Sociol. 25(2) (2001) 163–177.
CR  - [3] L. C. Freeman, A set of measures of centrality based on betweenness, Sociometry 40(1) (1977) 35–41.
CR  - [4] R. Frucht, F. Haray, On the corona of two graphs, Aequationes Math. 4(3) (1970) 322–325.
CR  - [5] J. A. Gallian, A dynamic survey of graph labeling, Electron. J. Combin. (2009) 1–219.
CR  - [6] F. Harary, The number of linear, directed, rooted, and connected graphs, Trans. Amer. Math. Soc.
78(2) (1955) 445–463.
CR  - [7] S. Kumar, K. Balakrishnan, M. Jathavedan, Betweenness centrality in some classes of graphs, Int. J.
Comb. 2014 (2014) 1–12.
CR  - [8] S. Kumar, K. Balakrishnan, On the number of geodesics of Petersen graph $ GP (n, 2)$, Electronic Notes
in Discrete Mathematics 63 (2017) 295–302.
CR  - [9] S.-C. Shee, Y.-S. Ho, The cordiality of one-point union of n copies of a graph, Discrete Math. 117(1–3)
(1993) 225–243.
UR  - https://doi.org/10.13069/jacodesmath.508983
L1  - https://dergipark.org.tr/en/download/article-file/620107
ER  -