Betweenness centrality in convex amalgamation of graphs

Authors

  • Sunil Kumar Raghavan Unnithan Department of Computer Applications, Cochin University of Science and Technology, Kerala, India https://orcid.org/0000-0002-8254-6511
  • Kannan Balakrishnan Department of Computer Applications, Cochin University of Science and Technology, Kerala, India

DOI:

https://doi.org/10.13069/jacodesmath.508983

Keywords:

Betweenness centrality, Central vertex, Convex subgraph, Vertex amalgamation, Edge amalgamation, Path amalgamation, Subgraph amalgamation

Abstract

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 shortest paths between pair of nodes. The removal of a node with highest betweenness from the network will most disrupt communications between other nodes because it lies on the largest number of paths. A large network can be thought of as inter-connection between smaller networks by means of different graph operations. Thus the structure of a composite graph can be studied by analysing its component graphs. In this paper we present the betweenness centrality of some classes of composite graphs constructed by the graph operation called amalgamation or merging.

Received: 9 May 2017 Accepted: 26 August 2018

Downloads

Download data is not yet available.

Downloads

Published

2019-01-15

How to Cite

Unnithan, S. K. R., & Balakrishnan, K. (2019). Betweenness centrality in convex amalgamation of graphs. Journal of Algebra Combinatorics Discrete Structures and Applications, 6(1), 21–38. https://doi.org/10.13069/jacodesmath.508983

Issue

Vol. 6 Issue 1: January 2019

Section

Articles