Vol. 10, No. 4, 2017

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

Volume 11, 1 issue

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
Cover Page
Editorial Board
Editors’ Addresses
Editors’ Interests
About the Journal
Scientific Advantages
Submission Guidelines
Submission Form
Ethics Statement
Subscriptions
Editorial Login
Author Index
Coming Soon
Contacts
 
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
Leverage centrality of knight's graphs and Cartesian products of regular graphs and path powers

Roger Vargas, Jr., Abigail Waldron, Anika Sharma, Rigoberto Flórez and Darren A. Narayan

Vol. 10 (2017), No. 4, 583–592
Abstract

In 2010, Joyce et al. defined the leverage centrality of a graph as a means to analyze connections within the brain. In this paper we investigate this property from a mathematical perspective and determine the leverage centrality for knight’s graphs, path powers, and Cartesian products.

Keywords
leverage centrality, knight's graphs
Mathematical Subject Classification 2010
Primary: 05C07
Milestones
Received: 9 September 2015
Revised: 4 January 2016
Accepted: 25 March 2016
Published: 7 March 2017

Communicated by Kenneth S. Berenhaut
Authors
Roger Vargas, Jr.
Mathematics and Statistics
Williams College
Williamstown, MA 01267
United States
Abigail Waldron
Mathematics Department
Presbyterian College
Clinton, SC 29325
United States
Anika Sharma
Department of Computer Science and Department of Mathematics
University of Buffalo
Buffalo, NY 14260
United States
Rigoberto Flórez
Department of Mathematics and Computer Science
The Citadel
Charleston, SC 29409
United States
Darren A. Narayan
School of Mathematical Sciences
Rochester Institute of Technology
Rochester, NY 14623
United States