Spectral bounds for the betweenness of a graph

In this paper we find spectral bounds (Laplacian matrix) for the vertex and the edge betweenness of a graph. We also relate the edge betweenness with the isoperimetric number and the edge forwarding and edge expansion indices of the graph allowing a new upper bound on its diameter. The results are of interest as they can be used in the study of communication properties of real networks, in particular for dynamical processes taking place on them (broadcasting, network synchronization, virus spreading, etc.).

[1]  Hawoong Jeong,et al.  Classification of scale-free networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Fan Chung Graham,et al.  The forwarding index of communication networks , 1987, IEEE Trans. Inf. Theory.

[3]  Patrick Solé,et al.  Expanding and Forwarding , 1995, Discret. Appl. Math..

[4]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[5]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[7]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[8]  Marie-Claude Heydemann,et al.  On forwarding indices of networks , 1989, Discret. Appl. Math..

[9]  Bojan Mohar,et al.  Isoperimetric numbers of graphs , 1989, J. Comb. Theory, Ser. B.

[10]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .