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

Maximum likelihood, also called the maximum likelihood method, is the procedure of finding the value of one or more parameters for a given statistic which makes the known ...

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

The Maxwell (or Maxwell-Boltzmann) distribution gives the distribution of speeds of molecules in thermal equilibrium as given by statistical mechanics. Defining a=sqrt(kT/m), ...

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

The mean distance of a (connected) graph is the mean of the elements of its graph distance matrix. Closed forms for some classes of named graphs are given in the following ...