TOPICS
Search

Search Results for ""


541 - 550 of 1622 for Arithmetic Mean Geometric Mean Inequalit...Search Results
The ABC (atom-bond connectivity) matrix A_(ABC) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt((d_i+d_j-2)/(d_id_j)), (1) where d_i are the ...
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 energy of a graph is defined as the sum of the absolute values of its graph eigenvalues (i.e., the sum of its graph spectrum terms). Other varieties of graph energy are ...
Let a hotel have a denumerable set of rooms numbered 1, 2, 3, .... Then any finite number n of guests can be accommodated without evicting the current guests by moving the ...
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 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 ...
The Randić spectral radius rho_(Randic) of a graph is defined as the largest eigenvalue of its Randić matrix.
The procedure used in subtraction to "borrow" 10 from the next higher digit column in order to obtain a positive difference in the column in question.
The surface which is the inverse of the ellipsoid in the sense that it "goes in" where the ellipsoid "goes out." It is given by the parametric equations x = acos^3ucos^3v (1) ...
1 ... 52|53|54|55|56|57|58 ... 163 Previous Next

...