EdgeConnectivity[g] gives the minimum number of edges whose deletion from graph g disconnects it. EdgeConnectivity[g, Cut] gives a set of edges of minimum size whose deletion ...

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

ShowLabeledGraph[g] displays graph g according to its embedding, with each vertex labeled with its vertex number.ShowLabeledGraph[g, l] uses the i\[Null]^th element of list l ...

VertexConnectivity[g] gives the minimum number of vertices whose deletion from graph g disconnects it. VertexConnectivity[g, Cut] gives a set of vertices of minimum size ...

BesselSimplify[expr] transforms Bessel functions in expr, trying to either decrease the number of Bessel functions, or convert Bessel functions into more elementary functions.

GammaSimplify[expr] transforms gamma functions in expr, trying to either decrease the number of gamma functions, or convert combinations of them into more elementary ...

PolyGammaSimplify[expr] transforms polygamma functions in expr, trying to either decrease the number of polygamma functions, or convert combinations of them into more ...

PolyLogSimplify[expr] transforms polylogarithm functions in expr, trying to either decrease the number of polylogarithm functions, or convert combinations of them into more ...

ZetaSimplify[expr] transforms zeta functions in expr, trying to either decrease the number of zeta functions, or convert combinations of them into more elementary functions.

Bias is an option to RationalInterpolation, GeneralRationalInterpolation, MiniMaxApproximation, and GeneralMiniMaxApproximation that specifies the bias to apply when ...