On Cartesian product of Euclidean distance matrices

Bapat, 2005, Distance matrix and Laplacian of a tree with attached graphs, Linear Algebra Appl., 411, 295, 10.1016/j.laa.2004.06.017 Bapat, 2014, Graphs and Matrices, 10.1007/978-1-4471-6569-9 Bapat, 2005, On distance matrices and Laplacians, Linear Algebra Appl., 401, 193, 10.1016/j.laa.2004.05.011 Gower, 1985, Properties of Euclidean and non-Euclidean distance matrices, Linear Algebra Appl., 67, 81, 10.1016/0024-3795(85)90187-9 Graham, 1977, On the distance matrix of a directed graph, J. Combin. Theory, 1, 85 Graham, 1971, On the addressing problem for loop switching, Bell. Syst. Tech. J., 50, 2495, 10.1002/j.1538-7305.1971.tb02618.x Imrich, 2000 Johnson, 1995, Connections between the real positive semidefinite and distance matrices completion problems, Linear Algebra Appl., 223/224, 375, 10.1016/0024-3795(95)00096-A Kurata, 2015, Moore–Penrose inverse of a Euclidean distance matrix, Linear Algebra Appl., 472, 106, 10.1016/j.laa.2015.01.032 Li, 2010, Euclidean and circum-Euclidean distance matrices: characterizations and linear preservers, Electron. J. Linear Algebra, 20, 739, 10.13001/1081-3810.1406 Tarazaga, 1996, Circum-Euclidean distance matrices and faces, Linear Algebra Appl., 232, 77, 10.1016/0024-3795(94)00031-X West, 1996