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 eigenvalues of a graph are defined as the eigenvalues of its adjacency matrix. The set of eigenvalues of a graph is called a graph spectrum. The largest eigenvalue ...

A surface given by the parametric equations x(u,v) = u (1) y(u,v) = v (2) z(u,v) = 1/3u^3+uv^2+2(u^2-v^2). (3) The handkerchief surface has stationary points summarized in ...

Let ad=bc, then Hirschhorn's 3-7-5 identity, inspired by the Ramanujan 6-10-8 identity, is given by (1) Another version of this identity can be given using linear forms. Let ...

A continuous transformation from one function to another. A homotopy between two functions f and g from a space X to a space Y is a continuous map G from X×[0,1]|->Y such ...

The hyperbolic cylinder is a quadratic surface given by the equation (x^2)/(a^2)-(y^2)/(b^2)=-1. (1) It is a ruled surface. It can be given parametrically by x = asinhu (2) y ...

A special nonsingular map from one manifold to another such that at every point in the domain of the map, the derivative is an injective linear transformation. This is ...

A semigroup S is said to be an inverse semigroup if, for every a in S, there is a unique b (called the inverse of a) such that a=aba and b=bab. This is equivalent to the ...

The partial differential equation (u_t)/(u_x)=1/4(u_(xxx))/(u_x)-3/8(u_(xx)^2)/(u_x^2)+3/2(p(u))/(u_x^2), where p(u)=1/4(4u^3-g_2u-g_3). The special cases ...

The Laplacian polynomial is the characteristic polynomial of the Laplacian matrix. The second smallest root of the Laplacian polynomial of a graph g (counting multiple values ...