Search Results for ""

The eigenvector corresponding to the second smallest eigenvalue (i.e., the algebraic connectivity) of the Laplacian matrix of a graph G. The Fiedler vector is used in ...

The first Yff triangle is the Cevian triangle DeltaA^'B^'C^' of the first Yff point. The area of the first Yff triangle is Delta=(u^3)/(2R), where R is the circumradius of ...

A single axiom that is satisfied only by NAND or NOR must be of the form "something equals a," since otherwise constant functions would satisfy the equation. With up to six ...

The Gegenbauer polynomials C_n^((lambda))(x) are solutions to the Gegenbauer differential equation for integer n. They are generalizations of the associated Legendre ...

Orthogonal polynomials are classes of polynomials {p_n(x)} defined over a range [a,b] that obey an orthogonality relation int_a^bw(x)p_m(x)p_n(x)dx=delta_(mn)c_n, (1) where ...

An affine tensor is a tensor that corresponds to certain allowable linear coordinate transformations, T:x^_^i=a^i_jx^j, where the determinant of a^i_j is nonzero. This ...

Tracing through the connections of a branchial graph gives rise to the notion of a kind of space in which states on different branches of history are laid out. In particular, ...

Using a Chebyshev polynomial of the first kind T(x), define c_j = 2/Nsum_(k=1)^(N)f(x_k)T_j(x_k) (1) = 2/Nsum_(k=1)^(N)f[cos{(pi(k-1/2))/N}]cos{(pij(k-1/2))/N}. (2) Then f(x) ...

The functions theta_s(u) = (H(u))/(H^'(0)) (1) theta_d(u) = (Theta(u+K))/(Theta(k)) (2) theta_c(u) = (H(u))/(H(K)) (3) theta_n(u) = (Theta(u))/(Theta(0)), (4) where H(u) and ...

The algebraic connectivity of a graph is the numerically second smallest eigenvalue (counting multiple eigenvalues separately) of the Laplacian matrix of a graph G. In other ...