The communicability distance in graphs

Linear Algebra and Its Applications

Volumn 436, Issue 11, 2012, Pages 4317-4328

  Estrada, Ernesto ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

Communicability; Euclidean distance; Graph distance; Graph spectrum; Matrix functions

Indexed keywords

GRAPHIC METHODS;

COMMUNICABILITY; EUCLIDEAN DISTANCE; GRAPH DISTANCES; GRAPH SPECTRA; MATRIX FUNCTIONS;

GRAPH THEORY;

EID: 84863320828     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2012.01.017     Document Type: Article

References (23)

1. E. Estrada, N. Hatano, Communicability in complex networks, Phys. Rev. E 77 (2008) 036111
2. E. Estrada, J.A. Rodríguez-Velázquez, Subgraph centrality in complex networks, Phys. Rev. E 71 (2005) 056103
3. E. Estrada, Characterization of 3D molecular structure, Chem. Phys. Lett. 319 (2000) 713-718.
4. E. Estrada, N. Hatano, Statistical-mechanical approach to subgraph centrality in complex networks, Chem. Phys. Lett. 439 (2007) 247-251. (Pubitemid 46628962)
5. E. Estrada, N. Hatano, M. Benzi, The physics of communicability in complex networks, Phys. Rep., in press, arXiv:1109.2950v1 doi:10.1016/j.physrep. 2012.01.006.
6. F. Buckley, F. Harary, Distance in Graphs, Addison-Wesley, Redwood City, CA, 1990.
7. D.J. Klein, M. Randić, Resistance distance, J. Math. Chem. 12 (1993) 81-95.
8. A. Ghosh, S. Boyd, A. Saberi, Minimizing effective resistance of a graph, SIAM Rev. 50 (2008) 37-66. (Pubitemid 351386903)
9. X. Xiao, I. Gutman, Resistance distance and Laplacian spectrum, Theor. Chem. Acc. 110 (2003) 284-289. (Pubitemid 37524165)
10. P. Chebotarev, E. Shamis, The forest metric for graph vertices, Electron. Notes Discrete Math. 11 (2002) 98-107.
11. P. Chebotarev, A class of graph-geodetic distances generalizing the shortest-path and the resistance distances, Discrete Appl. Math. 159 (2011) 295-302.
12. P. Chebotarev, The walk distances in graphs, arXiv:1103.2059v6.
13. M.M. Deza, E. Deza, Encyclopedia of Distance, Springer-Verlag, Berlin, 2009.
14. J.C. Gower, Euclidean distance geometry, Math. Sci. 7 (1982) 1-14.
15. J.C. Gower, Properties of Euclidean and non-Euclidean distance matrices, Linear Algebra Appl. 67 (1985) 81-97.
16. A.Y. Alfakih, On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices, Linear Algebra Appl. 416 (2006) 348-354. (Pubitemid 43795648)
17. J. Datorro, Convex Optimization and Euclidean Distance Geometry, Meboo Pub., Palo Alto, CA, 2011.
18. M. Abramowitz, I.A. Stegun, Handbook of Mathematical Functions, Dover, New York, 1965.
19. L. Collatz, U. Sinogowitz, Spektren endlicher Grafen, Abh. Math. Sem. Univ. Hamburg 21 (1957) 63-77.
20. D. Spielman, Spectral GraphTheory.TheLaplacian.Available from:〈http://www.cs.yale.edu/homes/spielman/561/lect02-09.pdf〉.
21. G. Rücker, C. Rücker, I. Gutman, On kites, comets and stars. Sumof eigenvector coefficients in (molecular) graphs, Z.Naturforsch 57a (2002) 143-153.
22. H. Wiener, Structural determination of paraffin boiling points, J. Amer. Chem. Soc. 69 (1947) 17-20.
23. D.J.Watts, S.H. Strogatz, Collective dynamics of 'small-world' networks, Nature 393 (1998) 409-410.