Search Results for ""

Also known as the a Lorentz transformation or Procrustian stretch, a hyperbolic transformation leaves each branch of the hyperbola x^'y^'=xy invariant and transforms circles ...

The clique polynomial C_G(x) for the graph G is defined as the polynomial C_G(x)=1+sum_(k=1)^(omega(G))c_kx^k, (1) where omega(G) is the clique number of G, the coefficient ...

"At least one" is a mathematical term meaning one or more. It is commonly used in situations where existence can be established but it is not known how to determine the total ...

Also known as "Laplacian" determinant expansion by minors, expansion by minors is a technique for computing the determinant of a given square matrix M. Although efficient for ...

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

A surface which a monkey can straddle with both legs and his tail. A simple Cartesian equation for such a surface is z=x(x^2-3y^2), (1) which can also be given by the ...

The pentagonal antiprism is the antiprism having a regular pentagon for the top and bottom bases. It is also the uniform polyhedron with Maeder index 77 (Maeder 1997) and ...

The pentagonal prism is a prism having two pentagonal bases and five rectangular sides. It is a heptahedron. The regular right pentagonal prism is uniform polyhedron U_(76). ...

The pentagrammic prism is the self-intersecting uniform polyhedron with Maeder index 78 (Maeder 1997), Coxeter index 33 (Coxeter et al. 1954), and Har'El index 3 (Har'El ...

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...