Search Results for ""

The Randić spectral radius rho_(Randic) of a graph is defined as the largest eigenvalue of its Randić matrix.

The Randić matrix A_(Randic) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=1/(sqrt(d_id_j)), (1) where d_i are the vertex degrees of the graph. In ...

Let A be an n×n matrix with complex or real elements with eigenvalues lambda_1, ..., lambda_n. Then the spectral radius rho(A) of A is rho(A)=max_(1<=i<=n)|lambda_i|, i.e., ...

The Laplacian spectral radius of a finite graph is defined as the largest value of its Laplacian spectrum, i.e., the largest eigenvalue of the Laplacian matrix (Lin et al. ...

The ABC (atom-bond connectivity) spectral radius rho_(ABC) of a graph is defined as the largest eigenvalue of its ABC matrix. Chen (2019) showed that for a tree on 3 or more ...

The Sombor spectral radius rho_(Sombor) of a graph is defined as the largest eigenvalue of the Sombor matrix. Liu et al. (2022) shows that for any tree, ...

The arithmetic-geometric spectral radius rho_(AG) of a graph is defined as the largest eigenvalue of its arithmetic-geometric matrix.

The Randić energy of a graph is defined as the graph energy of its Randić matrix, i.e., the sum of the absolute values of the eigenvalues of its Randić matrix.

The Randić index of a graph is defined as half the sum of the matrix elements of its Randić matrix. While the index was introduced to model the branching of the carbon-atom ...

The distance from the center of a circle to its perimeter, or from the center of a sphere to its surface. The radius is equal to half the diameter.