On Cartesian product of Euclidean distance matrices
From MaRDI portal
Publication:1629838
DOI10.1016/j.laa.2018.10.008zbMath1447.15023OpenAlexW2897992825MaRDI QIDQ1629838
Hiroshi Kurata, Ravindra B. Bapat
Publication date: 12 December 2018
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2018.10.008
treeMoore-Penrose inversepositive semidefinite matrixEuclidean distance matrixCartesian product of graphspredistance matrix
Trees (05C05) Theory of matrix inversion and generalized inverses (15A09) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) General theory of distance geometry (51K05) Multilinear algebra, tensor calculus (15A69)
Cites Work
- Unnamed Item
- Unnamed Item
- Properties of Euclidean and non-Euclidean distance matrices
- On distance matrices and Laplacians
- Connections between the real positive semidefinite and distance matrix completion problems
- Circum-Euclidean distance matrices and faces
- Moore-Penrose inverse of a Euclidean distance matrix
- Inverses of triangular matrices and bipartite graphs
- Distance matrix and Laplacian of a tree with attached graphs
- Euclidean and circum-Euclidean distance matrices: Characterizations and linear preservers
- On the distance matrix of a directed graph
- On the Addressing Problem for Loop Switching