Results 1 to 10 of about 596,753 (209)
Entropy measures of distance matrix [PDF]
Bonchev and Trinajstic defined two distance based entropy measures to measure the molecular branching of molecular graphs in 1977 [Information theory, distance matrix, and molecular branching, J. Chem. Phys., 38 (1977), 4517–4533]. In this paper we use these entropy measures which are based on distance matrices of graphs.
Bünyamin Şahin, Abdulgani Şahin
doaj +5 more sources
Product distance matrix of a graph and squared distance matrix of a tree [PDF]
Let G be a strongly connected, weighted directed graph. We define a product distance ?(i,j) for pairs i,j of vertices and form the corresponding product distance matrix. We obtain a formula for the determinant and the inverse of the product distance matrix.
BAPAT, RB, SIVASUBRAMANIAN, S
openaire +3 more sources
Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix
Peer ...
Estrada, Ernesto
openaire +4 more sources
Factoring distance matrix polynomials
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Collins, Karen L., Karen L. Collins
openaire +2 more sources
A q-analogue of the distance matrix of a tree
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bapat, R.B., Lal, A.K., Pati, Sukanta
openaire +2 more sources
ON DETERMINING THE DISTANCE SPECTRUM OF A CLASS OF DISTANCE INTEGRAL GRAPHS [PDF]
The distance eigenvalues of a connected graph $G$ are the eigenvalues of its distance matrix$D(G)$. A graph is called distance integral if all of itsdistance eigenvalues are integers.Let $n$ and $k$ be integers with $n>2k, k\geq1$.
Seyed M. Mirafzal, R. Kogani
doaj +1 more source
A Distance-Preserving Matrix Sketch
38 pages, 13 ...
Leland Wilkinson, Hengrui Luo
openaire +2 more sources
On the rank of the distance matrix of graphs
17 pages, 2 ...
Ezequiel Dratman +3 more
openaire +4 more sources
Analysis of amino acids network based on transition and transversion mutation of codons [PDF]
In this paper, we have developed a network of 20 amino acids based on a distance matrix of amino acids. This distance matrix is obtained by considering the transition and transversion mutation of codons.
Tazid Ali, Chandra Borah
doaj
Squared distance matrices of trees with matrix weights
Let T be a tree on n vertices whose edge weights are positive definite matrices of order s. The squared distance matrix of T, denoted by Δ, is the ns × ns block matrix with [Formula: see text], where d(i, j) is the sum of the weights of the edges in the ...
Iswar Mahato, M. Rajesh Kannan
doaj +1 more source

