SatisfiableQ[bf] gives True if a combination of values of variables exists that makes the Boolean function bf yield True.SatisfiableQ[expr, {a_1, a_2, ...}] gives True if a ...

MakeUndirected[g] gives the underlying undirected graph of the given directed graph g.

RemoveSinks is an option of PageRanks, PageRankVector, LinkRanks and LinkRankMatrix that specifies whether sinks are removed by linking with all vertices.

TopologicalSort[g] gives a list of vertices of g in topologically sorted order for a directed acyclic graph g.

NumberOfKPaths[g, v, k] returns a sorted list that contains the number of paths of length k to different vertices of g from v.NumberOfKPaths[al, v, k] behaves identically, ...

KatzCentrality[g, \[Alpha]] gives a list of Katz centralities for the vertices in the graph g and weight \[Alpha].KatzCentrality[g, \[Alpha], \[Beta]] gives a list of Katz ...

GraphPolynomial[n, x] returns a polynomial in x in which the coefficient of x^m is the number of nonisomorphic graphs with n vertices and m edges. GraphPolynomial[n, x, ...

TreeForm[expr] displays expr as a tree with different levels at different depths. TreeForm[expr, n] displays expr as a tree only down to level n.

ShowLegend[graphics, legend_1, legend_2, ...] places the legend_1, legend_2, ..., in the given graphic graphics.

Minimize[f, x] minimizes f with respect to x.Minimize[f, {x, y, ...}] minimizes f with respect to x, y, .... Minimize[{f, cons}, {x, y, ...}] minimizes f subject to the ...