@article{Blondel06,
title = {Social Leaders in Graphs },
author = {V. Blondel and C. de Kerchove and E. Huens and P. Van Dooren},
editor = {Lecture Notes in Control and Information Sciences},
year = {2006},
abstract = {We introduce the definition of Social Leader that gives a local centrality measure for each node in a graph. A node u is a Social Leader if the number of cycles of length 3 passing through u is greater than the corresponding number for its neighbors. This concept is used to visualize large graphs, identify influent agents in social networks (word of mouth effect) and find communities.},
keywords = {graph social toread }
}
::