S. Pemmaraju and S. Skiena, “All-Pairs Shortest Paths and Transitive Closure and Reduction. In: Computational Discrete Mathematics: Combinatorics and Graph Theory in Mathematica. Cambridge, England, Cambridge University Press, 2003. pp. 330-331 and 353-356.

has been cited by the following article:

• TITLE: Terrorist Networks, Network Energy and Node Removal: A New Measure of Centrality Based on Laplacian Energy

  AUTHORS: Xingqin Qi, Robert D. Duval, Kyle Christensen, Edgar Fuller, Arian Spahiu, Qin Wu, Yezhou Wu, Wenliang Tang, Cunquan Zhang

  KEYWORDS: Network; Centrality; Laplacian Energy; 9/11 Hijacking; Bali Bombing; Terrorism

  JOURNAL NAME: Social Networking, Vol.2 No.1, January 29, 2013

  ABSTRACT: In this work we propose a centrality measure for networks, which we refer to as Laplacian centrality, that provides a general framework for the centrality of a vertex based on the idea that the importance (or centrality) of a vertex is related to the ability of the network to respond to the deactivation or removal of that vertex from the network. In particular, the Laplacian centrality of a vertex is defined as the relative drop of Laplacian energy caused by the deactivation of this vertex. The Laplacian energy of network G withnvertices is defined as , where is the eigenvalue of the Laplacian matrix of G. Other dynamics based measures such as that of Masuda and Kori and PageRank compute the importance of a node by analyzing the way paths pass through a node while our measure captures this information as well as the way these paths are “redistributed” when the node is deleted. The validity and robustness of this new measure are illustrated on two different terrorist social network data sets and 84 networks in James Moody’s Add Health in school friendship nomination data, and is compared with other standard centrality measures.