AbstractIf A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive a formula for the Moore–Penrose inverse of PAP. As an application, we obtain a formula for the Moore–Penrose inverse of an Euclidean distance matrix (EDM) which generalizes formulae for the inverse of a EDM in the literature. To an invertible spherical EDM, we associate a Laplacian matrix (which we define as a positive semidefinite n×n matrix of rank n−1 and with zero row sums) and prove some properties. Known results for distance matrices of trees are derived as special cases. In particular, we obtain a formula due to Graham and Lovász for the inverse of the distance matrix of a tree. It is shown that if D is a nonsingular EDM and L ...
AbstractWe consider distance matrices of certain graphs and of points chosen in a rectangular grid. ...
A distance matrix D of order n is symmetric with elements , where dii=0. D is Euclidean when the qu...
AbstractThe Euclidean distance matrix completion problem (EDMCP) is the problem of determining wheth...
If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive ...
AbstractWe present a characterization of the nullspace and the rangespace of a Euclidean distance ma...
A matrix is Euclidean distance matrix (EDM) if there exist points such that the matrix elements are ...
A matrix is Euclidean distance matrix (EDM) if there exist points such that the matrix elements are ...
A matrix is Euclidean distance matrix (EDM) if there exist points such that the matrix elements are ...
AbstractWe present a characterization of those Euclidean distance matrices (EDMs) D which can be exp...
A matrix is Euclidean distance matrix (EDM) if there exist points such that the matrix elements are ...
A matrix is Euclidean distance matrix (EDM) if there exist points such that the matrix elements are ...
AbstractIn this paper we introduce new necessary and sufficient conditions for an Euclidean distance...
AbstractThe Euclidean distance matrix completion problem (EDMCP) is the problem of determining wheth...
AbstractA distance matrix D of order n is symmetric with elements −12dij2, where dii=0. D is Euclide...
AbstractIn this paper, a symmetric nonnegative matrix with zero diagonal and given spectrum, where e...
AbstractWe consider distance matrices of certain graphs and of points chosen in a rectangular grid. ...
A distance matrix D of order n is symmetric with elements , where dii=0. D is Euclidean when the qu...
AbstractThe Euclidean distance matrix completion problem (EDMCP) is the problem of determining wheth...
If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive ...
AbstractWe present a characterization of the nullspace and the rangespace of a Euclidean distance ma...
A matrix is Euclidean distance matrix (EDM) if there exist points such that the matrix elements are ...
A matrix is Euclidean distance matrix (EDM) if there exist points such that the matrix elements are ...
A matrix is Euclidean distance matrix (EDM) if there exist points such that the matrix elements are ...
AbstractWe present a characterization of those Euclidean distance matrices (EDMs) D which can be exp...
A matrix is Euclidean distance matrix (EDM) if there exist points such that the matrix elements are ...
A matrix is Euclidean distance matrix (EDM) if there exist points such that the matrix elements are ...
AbstractIn this paper we introduce new necessary and sufficient conditions for an Euclidean distance...
AbstractThe Euclidean distance matrix completion problem (EDMCP) is the problem of determining wheth...
AbstractA distance matrix D of order n is symmetric with elements −12dij2, where dii=0. D is Euclide...
AbstractIn this paper, a symmetric nonnegative matrix with zero diagonal and given spectrum, where e...
AbstractWe consider distance matrices of certain graphs and of points chosen in a rectangular grid. ...
A distance matrix D of order n is symmetric with elements , where dii=0. D is Euclidean when the qu...
AbstractThe Euclidean distance matrix completion problem (EDMCP) is the problem of determining wheth...