UnitransitiveGraph returns a 20-vertex, 3-unitransitive graph, discovered by Coxeter, that is not isomorphic to a 4-cage or a 5-cage.
DegreeSequence[g] gives the sorted degree sequence of graph g.
Harary
(Combinatorica Package Symbol) Harary[k, n] constructs the minimal k-connected graph on n vertices.
WaveletPhi[wave, x] gives the scaling function \[Phi](x) for the symbolic wavelet wave evaluated at x.WaveletPhi[wave] gives the scaling function as a pure function.
DeleteVertex[g, v] deletes a single vertex v from graph g. Here v is a vertex number.
HeawoodGraph returns a smallest (6, 3)-cage, a 3-regular graph with girth 6.
Computational geometry is the study of efficient algorithms for solving geometric problems. The nearest neighbor problem involves identifying one point, out of a set of ...
NecklacePolynomial[n, c, Cyclic] returns a polynomial in the colors in c whose coefficients represent numbers of ways of coloring an n-bead necklace with colors chosen from ...
FindFit
(Built-in Mathematica Symbol) FindFit[data, expr, pars, vars] finds numerical values of the parameters pars that make expr give a best fit to data as a function of vars. The data can have the form {{x_1, ...
It is often useful to be able to detect and precisely locate a change in a differential system. For example, with the detection of a singularity or state change, the ...