The communicability distance in graphs

DOI10.1016/J.LAA.2012.01.017zbMATH Open1243.05071OpenAlexW1979832945MaRDI QIDQ414715FDOQ414715

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Properties of Euclidean and non-Euclidean distance matrices
• Title not available (Why is that?)
• Spektren endlicher Grafen
• Encyclopedia of Distances
• The walk distances in graphs
• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
• On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices
• Minimizing Effective Resistance of a Graph
• Title not available (Why is that?)

Cited In (20)

• Predicting Triadic Closure in Networks Using Communicability Distance Functions
• Hyperspherical embedding of graphs and networks in communicability spaces
• Matrix functions in network analysis
• ``Melting of complex networks. A mathematical model of complex networks resilience to external stress
• 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
• Proof of a conjecture on communicability distance sum index of graphs
• Lower and upper bounds on graph communicabilities
• A few examples and counterexamples in spectral graph theory
• Communicability cosine distance: similarity and symmetry in graphs/networks
• A spectral method to detect community structure based on the communicability modularity
• Communicability angle and the spatial efficiency of networks
• Some bounds for total communicability of graphs
• A Shapley distance in graphs
• Effective Resistance Preserving Directed Graph Symmetrization
• The position value and the Myerson value for hypergraph communication situations
• Tuned communicability metrics in networks. The case of alternative routes for urban traffic
• Where to cut to delay a pandemic with minimum disruption? Mathematical analysis based on the SIS model
• Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix
• Network bipartitioning in the anti-communicability Euclidean space

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)