The communicability distance in graphs

DOI10.1016/j.laa.2012.01.017zbMath1243.05071OpenAlexW1979832945MaRDI QIDQ414715

Ernesto Estrada

Publication date: 11 May 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2012.01.017

zbMATH Keywords

Euclidean distancecommunicability

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Matrix exponential and similar functions of matrices (15A16)

Related Items (17)

Network bipartitioning in the anti-communicability Euclidean space ⋮ Proof of a conjecture on communicability distance sum index of graphs ⋮ A spectral method to detect community structure based on the communicability modularity ⋮ Predicting Triadic Closure in Networks Using Communicability Distance Functions ⋮ Some bounds for total communicability of graphs ⋮ Hyperspherical embedding of graphs and networks in communicability spaces ⋮ Matrix functions in network analysis ⋮ Communicability cosine distance: similarity and symmetry in graphs/networks ⋮ Tuned communicability metrics in networks. The case of alternative routes for urban traffic ⋮ Effective Resistance Preserving Directed Graph Symmetrization ⋮ Random neighborhood graphs as models of fracture networks on rocks: structural and dynamical analysis ⋮ Developments in the theory of randomized shortest paths with a comparison of graph node distances ⋮ ``Melting of complex networks. A mathematical model of complex networks resilience to external stress ⋮ A few examples and counterexamples in spectral graph theory ⋮ Communicability Angle and the Spatial Efficiency of Networks ⋮ Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix ⋮ Where to cut to delay a pandemic with minimum disruption? mathematical analysis based on the SIS model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The walk distances in graphs
• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
• Spektren endlicher Grafen
• Properties of Euclidean and non-Euclidean distance matrices
• On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices
• Minimizing Effective Resistance of a Graph
• Encyclopedia of Distances

This page was built for publication: The communicability distance in graphs