engleski

On the Eigenvalues of the Ordinary and Reciprocal Resistance-Distance Matrices

The resistance– distance between vertices and of a connected (molecular) graph is equal to the effective resistance between the respective nodes of the electrical network constructed corresponding to the graph such that the resistance of any two adjacent nodes is unity. We provide lower and upper bounds for the largest and smallest eigenvalues of the ordinary resistance– distance matrix and the reciprocal resistance– distance matrix (rrij) of a connected (molecular) graph.

ordinary resistance– distance matrix; reciprocal resistance– distance matrix; eigenvalues; lower and upper bounds

nije evidentirano