RegularGraph[k, n] constructs a semirandom k-regular graph on n vertices, if such a graph exists.

FromUnorderedPairs[l] constructs an edge list representation from a list of unordered pairs l, using a circular embedding.FromUnorderedPairs[l, v] uses v as the embedding for ...

RadialEmbedding[g, v] constructs a radial embedding of the graph g in which vertices are placed on concentric circles around v depending on their distance from v. ...

In catering to the fine points of mathematical typesetting and notational clarity, Mathematica provides a variety of special variant forms of letters.

RobertsonGraph returns a 19-vertex graph that is the unique (4, 5)-cage graph.

TutteGraph returns the Tutte graph, the first known example of a 3-connected, 3-regular, planar graph that is non-Hamiltonian.

BreadthFirstTraversal[g, v] performs a breadth-first traversal of graph g starting from vertex v, and gives the breadth-first numbers of the vertices. ...

A delay differential equation is a differential equation where the time derivatives at the current time depend on the solution and possibly its derivatives at previous times: ...

GraphPlot functionality is now available in the newly added built-in Mathematica kernel functions GraphPlot and LayeredGraphPlot. GraphPlot3D is now available as the newly ...

In general, a system of ordinary differential equations (ODEs) can be expressed in the normal form, The derivatives of the dependent variables x are expressed explicitly in ...