engleski

On sum-connectivity matrix and sum-connectivity energy of (molecular) graphs

If G is a (molecular) graph with n vertices, and d(i) is the degree of its i-th vertex, then the sum-connectivity matrix of G is the n x n matrix whose (i, j) -entry is equal to 1/root d(i) + d(j) if the i-th and the j-th vertices are adjacent and 0 otherwise. The sum-connectivity energy of a graph G is defined as the sum of the absolute values of the eigenvalues of the sum-connectivity matrix. Some properties including upper and lower bounds for the eigenvalues of the sum-connectivity matrix and the sum-connectivity energy are established, and the extremal cases are characterized.

Randic connectivity index; Randic matrix; product-connectivity matrix; sum-connectivity matrix; sum-connectivity energy; sum-connectivity index

nije evidentirano