The communicability distance in graphs

DOI10.1016/J.LAA.2012.01.017MaRDI QIDQ414715zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix
• Distances and volumina for graphs
• Graph distance measures based on topological indices revisited
• Some new results on distance-based graph invariants
• Publication:4351067

Cites work

• scientific article; zbMATH DE number 3814037 (Why is no real title available?)
• scientific article; zbMATH DE number 3774424 (Why is no real title available?)
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• scientific article; zbMATH DE number 2230269 (Why is no real title available?)
• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
• Encyclopedia of Distances
• Minimizing Effective Resistance of a Graph
• On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices
• Properties of Euclidean and non-Euclidean distance matrices
• Spektren endlicher Grafen
• The walk distances in graphs

Cited in

(20)

• Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix
• Predicting triadic closure in networks using communicability distance functions
• Matrix functions in network analysis
• ``Melting of complex networks. A mathematical model of complex networks resilience to external stress
• Some bounds for total communicability of graphs
• A Shapley distance in graphs
• Lower and upper bounds on graph communicabilities
• Network bipartitioning in the anti-communicability Euclidean space
• Tuned communicability metrics in networks. The case of alternative routes for urban traffic
• Proof of a conjecture on communicability distance sum index of graphs
• Hyperspherical embedding of graphs and networks in communicability spaces
• Where to cut to delay a pandemic with minimum disruption? Mathematical analysis based on the SIS model
• Communicability angle and the spatial efficiency of networks
• The position value and the Myerson value for hypergraph communication situations
• Developments in the theory of randomized shortest paths with a comparison of graph node distances
• Effective Resistance Preserving Directed Graph Symmetrization
• A few examples and counterexamples in spectral graph theory
• Random neighborhood graphs as models of fracture networks on rocks: structural and dynamical analysis
• A spectral method to detect community structure based on the communicability modularity
• Communicability cosine distance: similarity and symmetry in graphs/networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414715)