Inverse problems in statistical physics are motivated by the challenges of 'big data'in
different fields, in particular high-throughput experiments in biology. In inverse problems, the …

Abstract In 1971, Graham and Pollack established a relationship between the number of
negative eigenvalues of the distance matrix and the addressing problem in data …

We introduce a Laplacian and a signless Laplacian for the distance matrix of a connected
graph, called the distance Laplacian and distance signless Laplacian, respectively. We …

The distance energy of a graph G is a recently developed energy-type invariant, defined as
the absolute deviation of the eigenvalues of the distance matrix of G. It is a useful molecular …

The distance energy of a graph G is a recently developed energy-type invariant, defined as
the sum of absolute values of the eigenvalues of the distance matrix of G. There was a vast …

For a connected graph, the distance spectral radius is the largest eigenvalue of its distance
matrix, and the distance energy is defined as the sum of the absolute values of the …

We consider a q-analogue of the distance matrix (called the q-distance matrix) of an
unweighted tree and give formulae for the inverse and the determinant, which generalize the …

In biological experiments researchers often have information in the form of a graph that
supplements observed numerical data. Incorporating the knowledge contained in these …

Özet The distance energy of a graph G is defined as the sum of the absolute values of the
eigenvalues of the distance matrix of G. In this note, we obtain an upper bound for the …

The distance spectral radius ρ (G) of a graph G is the largest eigenvalue of the distance
matrix D (G). Recently, many researches proposed the use of ρ (G) as a molecular structure …