Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix

DOI10.1016/j.laa.2022.09.025zbMath1503.05030OpenAlexW4298009415MaRDI QIDQ2093511

Ernesto Estrada

Publication date: 8 November 2022

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

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

zbMATH Keywords

algebraic graph theoryspectral graph theoryresistance distanceEuclidean distance matrixcommunicability distancespherical EDM

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Distance in graphs (05C12) Discrete geometry (52C99)

Related Items

Communicability cosine distance: similarity and symmetry in graphs/networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperspherical embedding of graphs and networks in communicability spaces
• The communicability distance in graphs
• Effective graph resistance
• A remark on the faces of the cone of Euclidean distance matrices
• On Euclidean distance matrices
• On resistance-distance and Kirchhoff index
• Properties of Euclidean and non-Euclidean distance matrices
• Eigenvalues of the resistance-distance matrix of complete multipartite graphs
• Circum-Euclidean distance matrices and faces
• The many facets of the Estrada indices of graphs and networks
• Network bipartitioning in the anti-communicability Euclidean space
• Network bipartivity and the transportation efficiency of European passenger airlines
• On resistance distance of Markov chain and its sum rules
• Communicability Angle and the Spatial Efficiency of Networks
• Euclidean and circum-Euclidean distance matrices: Characterizations and linear preservers
• Matrix Analysis