ExtractCycles[g] gives a maximal list of edge-disjoint cycles in graph g.

MaximumSpanningTree[g] uses Kruskal's algorithm to find a maximum spanning tree of graph g.

PseudographQ[g] yields True if graph g is a pseudograph, meaning it contains self-loops.

SimpleQ[g] yields True if g is a simple graph, meaning it has no multiple edges and contains no self-loops.

TransitiveReduction[g] finds a smallest graph that has the same transitive closure as g.

Bicomponents[g] gives the biconnected components of the undirected graph g.

Content in a Mathematica notebook is organized in cells. Each cell has a cell bracket that appears along the right edge of the notebook window. Markings on a cell bracket ...

FindGeneratingFunction[{a_1, a_2, ...}, x] attempts to find a simple generating function in x whose n\[Null]^th series coefficient is a_n.FindGeneratingFunction[{{n_1, a_1}, ...

Integrated into the Mathematica system are powerful functions for analyzing large volumes of discrete and integer data—often conveniently specified using Mathematica's ...

Mathematica serves as a convenient and extensible environment for doing basic math. In addition to performing advanced calculations, Mathematica can also be used as a ...