id: 06033323
dt: j
an: 06033323
au: Estrada, Ernesto
ti: The communicability distance in graphs.
so: Linear Algebra Appl. 436, No. 11, 4317-4328 (2012).
py: 2012
pu: Elsevier Science Inc. (North-Holland), New York, NY
la: EN
cc: 
ut: Euclidean distance; communicability
ci: 
li: doi:10.1016/j.laa.2012.01.017
ab: This paper discusses communicability distance on a Euclidean distance and
    gives explanations for paths, cycles, stars and complete graphs on
    $n$-nodes. A new graph invariant, the sum of all communicability
    distances in graphs, is introduced and compared with standard invariant
    Wiener and Kirchhoff indices of graphs
rv: G. N. Prasanth (Alappuzha)