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ć 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.

By a suitable rearrangement of terms, a conditionally convergent series may be made to converge to any desired value, or to diverge. For example, S = 1-1/2+1/3-1/4+1/5+... ...

A Markov chain is collection of random variables {X_t} (where the index t runs through 0, 1, ...) having the property that, given the present, the future is conditionally ...

A series which is not convergent. Series may diverge by marching off to infinity or by oscillating. Divergent series have some curious properties. For example, rearranging ...

A series is said to be convergent if it approaches some limit (D'Angelo and West 2000, p. 259). Formally, the infinite series sum_(n=1)^(infty)a_n is convergent if the ...

The Jacobsthal numbers are the numbers obtained by the U_ns in the Lucas sequence with P=1 and Q=-2, corresponding to a=2 and b=-1. They and the Jacobsthal-Lucas numbers (the ...

The binomial distribution gives the discrete probability distribution P_p(n|N) of obtaining exactly n successes out of N Bernoulli trials (where the result of each Bernoulli ...

The probability that a variate would assume a value greater than or equal to the observed value strictly by chance: P(z>=z_(observed)).