Search Results for ""

Given the generating functions defined by (1+53x+9x^2)/(1-82x-82x^2+x^3) = sum_(n=1)^(infty)a_nx^n (1) (2-26x-12x^2)/(1-82x-82x^2+x^3) = sum_(n=0)^(infty)b_nx^n (2) ...

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.

If f:D->Y is a map (a.k.a. function, transformation, etc.) over a domain D, then the range of f, also called the image of D under f, is defined as the set of all values that ...

If alpha is any number and m and n are integers, then there is a rational number m/n for which |alpha-m/n|<=1/n. (1) If alpha is irrational and k is any whole number, there ...

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...

Pick two real numbers x and y at random in (0,1) with a uniform distribution. What is the probability P_(even) that [x/y], where [r] denotes the nearest integer function, is ...

There are at least two sequences attributed to B. Recamán. One is the sequence a_n formed by taking a_1=1 and letting a_n={a_(n-1)-n if a_(n-1)-n>0 and is new; a_(n-1)+n ...