Search Results for ""

A graph G is hypohamiltonian if G is nonhamiltonian, but G-v is Hamiltonian for every v in V (Bondy and Murty 1976, p. 61). The Petersen graph, which has ten nodes, is the ...

The (general) icosahedron is a 20-faced polyhedron (where icos- derives from the Greek word for "twenty" and -hedron comes from the Indo-European word for "seat"). Examples ...

An improper integral is a definite integral that has either or both limits infinite or an integrand that approaches infinity at one or more points in the range of ...

An independent variable is a variable whose values don't depend on changes in other variables. This is in contrast to the definition of dependent variable. As with dependent ...

An infinitesimal transformation of a vector r is given by r^'=(I+e)r, (1) where the matrix e is infinitesimal and I is the identity matrix. (Note that the infinitesimal ...

An array A=a_(ij), i,j>=1 of positive integers is called an interspersion if 1. The rows of A comprise a partition of the positive integers, 2. Every row of A is an ...

An intrinsically linked graph is a graph having the property that any embedding of it in three dimensions contains a nontrivial link. A graph is intrinsically linked iff it ...

The invertible matrix theorem is a theorem in linear algebra which gives a series of equivalent conditions for an n×n square matrix A to have an inverse. In particular, A is ...

A relation connecting the values of a meromorphic function inside a disk with its boundary values on the circumference and with its zeros and poles (Jensen 1899, Levin 1980). ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...