Add to ORKGIn this paper, block distance matrices are introduced. Suppose F is a square block matrix in which each block is a symmetric matrix of some given order. If F is positive semidefinite, the block distance matrix D is defined as a matrix whose (i, j)-block is given by Dij = Fii+Fjj-2Fij. When each block in F is 1×1 (i.e., a real number), D is a usual Euclidean distance matrix. Many interesting properties of Euclidean distance matrices to block distance matrices are extended in this paper. Finally, distance matrices of trees with matrix weights are investigated
AbstractThe positive semidefinite and Euclidean distance matrix completion problems have received a ...
If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive ...
ABSTRACT. A formula for the determinant of the distance matrix for a tree as a function of the numbe...
Let T be a tree with vertex set [n] = {1, 2, ..., n}. For each i is an element of [n], let m(i) be a...
The distance matrix, which is a structure less common than the adjacency matrix [ l] , has been incr...
AbstractLet T be a tree with n vertices and let D be the distance matrix of T. According to a classi...
We consider distance matrices of certain graphs and of points chosen in a rectangular grid. Formulae...
summary:Let $T$ be a tree with $n$ vertices. To each edge of $T$ we assign a weight which is a posit...
summary:Let $T$ be a tree with $n$ vertices. To each edge of $T$ we assign a weight which is a posit...
summary:Let $T$ be a tree with $n$ vertices. To each edge of $T$ we assign a weight which is a posit...
Let T be a tree with n vertices and let D be the distance matrix of T. According to a classical resu...
AbstractWe consider distance matrices of certain graphs and of points chosen in a rectangular grid. ...
AbstractThough the real symmetric positive semidefinite (PSD) matrices and the Euclidean distance ma...
AbstractThe algorithm we present is a natural next step to well-known algorithms for finding optimal...
AbstractWe deal with distance matrices of real (this means, not necessarily integer) numbers. It is ...
AbstractThe positive semidefinite and Euclidean distance matrix completion problems have received a ...
If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive ...
ABSTRACT. A formula for the determinant of the distance matrix for a tree as a function of the numbe...
Let T be a tree with vertex set [n] = {1, 2, ..., n}. For each i is an element of [n], let m(i) be a...
The distance matrix, which is a structure less common than the adjacency matrix [ l] , has been incr...
AbstractLet T be a tree with n vertices and let D be the distance matrix of T. According to a classi...
We consider distance matrices of certain graphs and of points chosen in a rectangular grid. Formulae...
summary:Let $T$ be a tree with $n$ vertices. To each edge of $T$ we assign a weight which is a posit...
summary:Let $T$ be a tree with $n$ vertices. To each edge of $T$ we assign a weight which is a posit...
summary:Let $T$ be a tree with $n$ vertices. To each edge of $T$ we assign a weight which is a posit...
Let T be a tree with n vertices and let D be the distance matrix of T. According to a classical resu...
AbstractWe consider distance matrices of certain graphs and of points chosen in a rectangular grid. ...
AbstractThough the real symmetric positive semidefinite (PSD) matrices and the Euclidean distance ma...
AbstractThe algorithm we present is a natural next step to well-known algorithms for finding optimal...
AbstractWe deal with distance matrices of real (this means, not necessarily integer) numbers. It is ...
AbstractThe positive semidefinite and Euclidean distance matrix completion problems have received a ...
If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive ...
ABSTRACT. A formula for the determinant of the distance matrix for a tree as a function of the numbe...