Downloads provided by UsageCounts
handle: 10261/351427
The communicability distance (Estrada (2012) [5]) is a useful metric to characterize alternative navigational routes in graphs. Here we prove that it is the resistance distance between a pair of nodes in a weighted graph. We extend this result and prove that every nonsingular Euclidean distance matrix is the resistance distance matrix of a weighted graph. We briefly analyze some mathematical properties of the communicability Laplacian matrix which emerges from the current analysis.
The author thanks anonymous referee for important corrections on the original version. Financial support by the grant PID2019-107603GB-I00 of the MCIN/AEI/0.13039/501100011033/ is also acknowledged.
Peer reviewed
Euclidean distance matrix (EDM), Spectral graph theory, Spherical EDM, Communicability distance, Resistance distance, Algebraic graph theory
Euclidean distance matrix (EDM), Spectral graph theory, Spherical EDM, Communicability distance, Resistance distance, Algebraic graph theory
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 9 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
| views | 27 | |
| downloads | 41 |

Views provided by UsageCounts
Downloads provided by UsageCounts