Search Results for ""

The Pell graph Pi_n is the graph defined as follows. Consider n-tuples of (0,1,2) such that maximal blocks of an odd number of 2's are forbidden. Take these as the vertices ...

A pyramid is a polyhedron with one face (known as the "base") a polygon and all the other faces triangles meeting at a common polygon vertex (known as the "apex"). A right ...

The triangle DeltaA^*B^*C^* obtained by reflecting the vertices of a reference triangle DeltaABC about the opposite sides is called the reflection triangle (Grinberg 2003). ...

The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...

The snub cubical graph is the Archimedean graph on 24 nodes and 60 edges obtained by taking the skeleton of the snub cube. It is a quintic graph, is planar, Hamiltonian, and ...

The snub dodecahedral graph is a quintic graph on 60 nodes and 150 edges that corresponds to the skeleton of the snub dodecahedron, great inverted snub icosidodecahedron, ...

The molecular topological index is a graph index defined by MTI=sum_(i=1)^nE_i, where E_i are the components of the vector E=(A+D)d, with A the adjacency matrix, D the graph ...

An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...

Since the derivative of a constant is zero, any constant may be added to an indefinite integral (i.e., antiderivative) and will still correspond to the same integral. Another ...

A pullback is a general categorical operation appearing in a number of mathematical contexts, sometimes going under a different name. If T:V->W is a linear transformation ...