Search Results for ""

All Mathieu functions have the form e^(irz)f(z), where f(z) has period 2pi and r is known as the Mathieu characteristic exponent. This exponent is returned by the Wolfram ...

The Mathon graphs are three strongly regular graphs on 784 vertices with regular parameters as summarized in the following tables. k spectrum regular parameters 0 ...

Nonhomogeneous matrix equations of the form Ax=b (1) can be solved by taking the matrix inverse to obtain x=A^(-1)b. (2) This equation will have a nontrivial solution iff the ...

The matrix tree theorem, also called Kirchhoff's matrix-tree theorem (Buekenhout and Parker 1998), states that the number of nonidentical spanning trees of a graph G is equal ...

A maximal ideal of a ring R is an ideal I, not equal to R, such that there are no ideals "in between" I and R. In other words, if J is an ideal which contains I as a subset, ...

Let A be a commutative complex Banach algebra. The space of all characters on A is called the maximal ideal space (or character space) of A. This space equipped with the ...

The proposition that every proper ideal of a Boolean algebra can be extended to a maximal ideal. It is equivalent to the Boolean representation theorem, which can be proved ...

A maximal independent edge set of a graph is an independent edge set that cannot be expanded to another independent edge set by addition of any edge in the graph. Note that a ...

A maximal irredundant set is an irredundant set that cannot be expanded to another irredundant set by addition of any vertex in the graph. Note that a maximal irredundant set ...

A maximally nonhamiltonian graph is a nonhamiltonian graph G for which G+e is Hamiltonian for each edge e in the graph complement of G^_, i.e., every two nonadjacent vertices ...