Search Results for ""

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ć spectral radius rho_(Randic) of a graph is defined as the largest eigenvalue of its Randić matrix.

A vector is formally defined as an element of a vector space. In the commonly encountered vector space R^n (i.e., Euclidean n-space), a vector is given by n coordinates and ...

The first practical algorithm for determining if there exist integers a_i for given real numbers x_i such that a_1x_1+a_2x_2+...+a_nx_n=0, or else establish bounds within ...

A random graph is a graph in which properties such as the number of graph vertices, graph edges, and connections between them are determined in some random way. The graphs ...

The condition for isoenergetic nondegeneracy for a Hamiltonian H=H_0(I)+epsilonH_1(I,theta) is |(partial^2H_0)/(partialI_ipartialI_j) (partialH_0)/(partialI_i); ...

An extremely powerful theorem in physics which states that each symmetry of a system leads to a physically conserved quantity. Symmetry under translation corresponds to ...

The mean square deviation of the best local fit straight line to a staircase cumulative spectral density over a normalized energy scale.

A function f is said to have a upper bound C if f(x)<=C for all x in its domain. The least upper bound is called the supremum. A set is said to be bounded from above if it ...

A map u:M->N, between two compact Riemannian manifolds, is a harmonic map if it is a critical point for the energy functional int_M|du|^2dmu_M. The norm of the differential ...