Search Results for ""

A block graph, also called a clique tree, is a simple graph in which every block is a complete graph. The numbers of connected block graphs on n=1, 2, ... vertices are 1, 1, ...

When referring to a planar object, "free" means that the object is regarded as capable of being picked up out of the plane and flipped over. As a result, mirror images are ...

The path graph P_n is a tree with two nodes of vertex degree 1, and the other n-2 nodes of vertex degree 2. A path graph is therefore a graph that can be drawn so that all of ...

A system of linear differential equations (dy)/(dz)=A(z)y, (1) with A(z) an analytic n×n matrix, for which the matrix A(z) is analytic in C^_\{a_1,...,a_N} and has a pole of ...

Also known as the Serret-Frenet formulas, these vector differential equations relate inherent properties of a parametrized curve. In matrix form, they can be written [T^.; ...

The Stammler triangle is the triangle formed by the centers of the Stammler circles. It is an equilateral triangle. It circumscribes the circumcircle and homothetic to the ...

The algebraic unknotting number of a knot K in S^3 is defined as the algebraic unknotting number of the S-equivalence class of a Seifert matrix of K. The algebraic unknotting ...

The operator norm of a linear operator T:V->W is the largest value by which T stretches an element of V, ||T||=sup_(||v||=1)||T(v)||. (1) It is necessary for V and W to be ...

Let beta=detB=x^2-ty^2, (1) where B is the Brahmagupta matrix, then det[B(x_1,y_1) B(x_2,y_2)] = det[B(x_1,y_1)]det[B(x_2,y_2)] (2) = beta_1beta_2]. (3)

An analog of the determinant for number triangles defined as a signed sum indexed by set partitions of {1,...,n} into pairs of elements. The Pfaffian is the square root of ...