Search Results for ""

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

The natural norm induced by the L1-norm is called the maximum absolute column sum norm and is defined by ||A||_1=max_(j)sum_(i=1)^n|a_(ij)| for a matrix A. This matrix norm ...

This problem is NP-complete (Garey and Johnson 1983).

Let U subset= C be a domain, and let f be an analytic function on U. Then if there is a point z_0 in U such that |f(z_0)|>=|f(z)| for all z in U, then f is constant. The ...

A maximum spanning tree is a spanning tree of a weighted graph having maximum weight. It can be computed by negating the weights for each edge and applying Kruskal's ...

Maxwell's equations are the system of partial differential equations describing classical electromagnetism and therefore of central importance in physics. In the so-called ...

The McCarthy-91 function is the recursive function defined for positive integer n by M(n)={M(M(n+11)) for n<=100; n-10 for n>100. (1) It takes the value 91 for all n=1, 2, ...

The three circumcircles through the triangle centroid G of a given triangle DeltaA_1A_2A_3 and the pairs of the vertices of the second Brocard triangle are called the McCay ...

The McLaughlin group is the sporadic group McL of order |McL| = 898128000 (1) = 2^7·3^6·5^3·7·11. (2) It is implemented in the Wolfram Language as McLaughlinGroupMcL[].