Results 1 to 10 of about 2,194,803 (325)
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 +7 more sources
A cospectral construction for the generalized distance matrix [PDF]
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 +2 more sources
Quantitative analysis of visual codewords of a protein distance matrix. [PDF]
Pražnikar J, Attygalle NT.
europepmc +2 more sources
Distance to the nearest stable Metzler matrix [PDF]
This paper considers the non-convex problem of finding the nearest Metzler matrix to a given possibly unstable matrix. Linear systems whose state vector evolves according to a Metzler matrix have many desirable properties in analysis and control with regard to scalability.
James Anderson
openalex +5 more sources
Squared distance matrix of a weighted tree
Let T be a tree with vertex set {1, …, n} such that each edge is assigned a nonzero weight. The squared distance matrix of T, denoted by Δ, is the n × n matrix with (i, j)-element d(i, j)2, where d(i, j) is the sum of the weights of the edges on the ...
Ravindra B. Bapat
doaj +3 more sources
On spectral radius of the generalized distance matrix of a graph [PDF]
Shariefuddin Pirzada
doaj +2 more sources
A Distance-Preserving Matrix Sketch
38 pages, 13 ...
Wilkinson, Leland, Luo, Hengrui
openaire +2 more sources
Multi-distance support matrix machines [PDF]
Real-world data such as digital images, MRI scans and electroencephalography signals are naturally represented as matrices with structural information. Most existing classifiers aim to capture these structures by regularizing the regression matrix to be low-rank or sparse.
Yunfei Ye, Dong Han
openaire +2 more sources
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
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

