The Journal of the Indian Mathematical Society

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Centrality betweenness in Some Join of Graphs


Affiliations
1 Department of Mathematics, BJM Govt. College, Chavara, Kollam, Kerala, India
2 Department of Computer Applications, Cochin University of Science and Technology, Kerala, India
     

   Subscribe/Renew Journal


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.

Keywords

Centrality betweenness, Join, Geodesic, Antipodal Vertex.
Subscription Login to verify subscription
User
Notifications
Font Size


  • 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.


Abstract Views: 272

PDF Views: 0




  • Centrality betweenness in Some Join of Graphs

Abstract Views: 272  |  PDF Views: 0

Authors

Sunil Kumar
Department of Mathematics, BJM Govt. College, Chavara, Kollam, Kerala, India
Kannan Balakrishnan
Department of Computer Applications, Cochin University of Science and Technology, Kerala, India

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.

Keywords


Centrality betweenness, Join, Geodesic, Antipodal Vertex.

References





DOI: https://doi.org/10.18311/jims%2F2023%2F28973