Results 11 to 20 of about 6,352,710 (356)

A constructive algorithm for realizing a distance matrix [PDF]

open access: greenEuropean Journal of Operational Research, 2005
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric by a graph, such that the total length of the graph is minimized. For that purpose, we give a constructive algorithm based on a technique of reduction, fusion and deletion.
Sacha Varone
openalex   +3 more sources

Matrix versions of the Hellinger distance [PDF]

open access: yesLetters in Mathematical Physics, 2019
On the space of positive definite matrices we consider distance functions of the form $d(A,B)=\left[\tr\mathcal{A}(A,B)-\tr\mathcal{G}(A,B)\right]^{1/2},$ where $\mathcal{A}(A,B)$ is the arithmetic mean and $\mathcal{G}(A,B)$ is one of the different versions of the geometric mean.
Bhatia, Rajendra   +2 more
openaire   +6 more sources

Determinant of the distance matrix of a tree with matrix weights

open access: bronzeLinear Algebra and its Applications, 2005
AbstractLet T be a tree with n vertices and let D be the distance matrix of T. According to a classical result due to Graham and Pollack, the determinant of D is a function of n, but does not depend on T. We allow the edges of T to carry weights, which are square matrices of a fixed order. The distance matrix D of T is then defined in a natural way. We
R.B. Bapat
openalex   +3 more sources

The generalized distance matrix

open access: yesLinear Algebra and its Applications, 2019
Abstract Let D ( G ) and D i a g ( T r ) denote the distance matrix and diagonal matrix of the vertex transmissions of a simple connected graph G, respectively. The distance signless Laplacian matrix of G is defined as D Q ( G ) = D i a g ( T r ) + D ( G ) .
Jing-Xiang He, Gui-Xian Tian, Shu-Yu Cui
openaire   +3 more sources

Gait Evaluation Using Procrustes and Euclidean Distance Matrix Analysis

open access: greenIEEE journal of biomedical and health informatics, 2018
Objective assessment of gait is important in the treatment and rehabilitation of patients with different diseases. In this paper, we propose a gait evaluation system using the Procrustes and Euclidean distance matrix analysis.
Arif Reza Anwary   +2 more
openalex   +3 more sources

Realizing the distance matrix of a graph [PDF]

open access: bronzeJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1966
A. J. Goldman
openalex   +3 more sources

A cospectral construction for the generalized distance matrix

open access: yesSpecial Matrices
The generalized distance matrix of a graph is a matrix in which the (i,j)\left(i,j)th entry is a function, ff, of the distance between vertex ii and vertex jj.
Friesen Ori   +5 more
doaj   +3 more sources

A note on the tree realizability of a distance matrix

open access: bronzeJournal of Combinatorial Theory, 1969
J. M. S. Simões Pereira
openalex   +4 more sources

Home - About - Disclaimer - Privacy