EdgeCoverQ[g, elist] yields True if the edge list elist is an edge cover of the graph g and False otherwise.
FindMinimum[f, x] searches for a local minimum in f, starting from an automatically selected point.FindMinimum[f, {x, x_0}] searches for a local minimum in f, starting from ...
RootApproximant[x] converts the number x to one of the "simplest" algebraic numbers that approximates it well.RootApproximant[x, n] finds an algebraic number of degree at ...
VertexCoverQ[g, vlist] yields True if the vertex list vlist is a vertex cover of the graph g, and False otherwise.
HararyGraph[k, n] generates the minimal k-connected graph on n vertices H k, n.
Mathematica has a flexible system for specifying arbitrary symbolic assumptions about variables. It uses a wide range of sophisticated algorithms to infer the consequences of ...
In calculus even more than other areas, Mathematica packs centuries of mathematical development into a small number of exceptionally powerful functions. Continually enhanced ...
Mathematica's handling of polynomial systems is a tour de force of algebraic computation. Building on mathematical results spanning more than a century, Mathematica for the ...
Root
(Built-in Mathematica Symbol) Root[f, k] represents the exact k\[Null]^th root of the polynomial equation f[x] == 0. Root[{f, x_0}] represents the exact root of the general equation f[x] == 0 near x = ...
MinimalStateSpaceModel[ss] gives the minimal state-space model of the StateSpaceModel object ss.