Centrality betweenness in Some Join of Graphs

Jump To References Section

Authors

  • Department of Mathematics, BJM Govt. College, Chavara, Kollam, Kerala ,IN
  • Department of Computer Applications, Cochin University of Science and Technology, Kerala ,IN

DOI:

https://doi.org/10.18311/jims/2023/28973

Keywords:

Centrality betweenness, Join, Geodesic, Antipodal Vertex.
05C30

Abstract

Centrality measures the status of a vertex in a graph. Centrality betweenness determines how often a vertex comes in between pairs of other vertices. Since shortest paths are considered here, the centrality betweenness of a vertex is proportional to the number of shortest paths passing through it. Join is an important graph operation which interconnects two graphs. The centrality betweenness of some derived graphs generated by this operation is presented here.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Published

2023-07-12

How to Cite

Kumar, S., & Balakrishnan, K. (2023). Centrality betweenness in Some Join of Graphs. The Journal of the Indian Mathematical Society, 90(3-4), 263–274. https://doi.org/10.18311/jims/2023/28973
Received 2021-11-13
Accepted 2022-06-22
Published 2023-07-12

 

References

Alex Bavelas, A mathematical model for group structure, Applied Anthropology,7 (1948), 16 - 30.

Stephen P Borgatti and Martin G Everett, A graph-theoretic perspective on centrality, Social networks, Elsevier, 28 (2006), 466 - 484.

Fred Buckley and Frank Harary, On the Euclidean dimension of a wheel, Graphs and Combinatorics, Springers 4 (1988), 23 - 30.

Linton C Freeman, A set of measures of centrality based on betweenness, Sociometry, 40 (1977), 35 - 41.

F. Harary, Graph Theory, Addison Wesley, Reading, Massachusetts 1969.

Bj¨orn H Junker and Falk Schreiber, Analysis of biological networks, John Wiley & Sons, 2008.