Vol. 12, No. 1, 2019

Download this article
Download this article For screen
For printing
Recent Issues

Volume 17
Issue 4, 543–722
Issue 3, 363–541
Issue 2, 183–362
Issue 1, 1–182

Volume 16, 5 issues

Volume 15, 5 issues

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Editors' interests
 
Subscriptions
 
ISSN 1944-4184 (online)
ISSN 1944-4176 (print)
 
Author index
To appear
 
Other MSP journals
Intersecting geodesics and centrality in graphs

Emily Carter, Bryan Ek, Danielle Gonzalez, Rigoberto Flórez and Darren A. Narayan

Vol. 12 (2019), No. 1, 31–43
Abstract

In a graph, vertices that are more central are often placed at the intersection of geodesics between other pairs of vertices. This model can be applied to organizational networks, where we assume the flow of information follows shortest paths of communication and there is a required action (i.e., signature or approval) by each person located on these paths. The number of actions a person must perform is linked to both the topology of the network as well as their location within it. The number of expected actions that a person must perform can be quantified by betweenness centrality. The betweenness centrality of a vertex v is the ratio of shortest paths between all other pairs of vertices u and w in which v appears to the total number of shortest paths from u to w. We precisely compute the betweenness centrality for vertices in several families of graphs motivated by different organizational networks.

Keywords
betweenness centrality, shortest paths, distance
Mathematical Subject Classification 2010
Primary: 05C12, 05C82
Milestones
Received: 4 March 2017
Revised: 26 July 2017
Accepted: 20 January 2018
Published: 31 May 2018

Communicated by Kenneth S. Berenhaut
Authors
Emily Carter
School of Mathematical Sciences
Rochester Institute of Technology
Rochester, NY
United States
Bryan Ek
Department of Mathematics
Rutgers University
Piscataway, NJ
United States
Danielle Gonzalez
Department of Software Engineering
Rochester Institute of Technology
Rochester, NY
United States
Rigoberto Flórez
Department of Mathematics and Computer Science
The Citadel
Charleston, SC
United States
Darren A. Narayan
School of Mathematical Sciences
Rochester Institute of Technology
Rochester, NY
United States