Hypercube[n] constructs an n-dimensional hypercube.

MakeDirected[g] constructs a directed graph from a given undirected graph g by replacing each undirected edge in g by two directed edges pointing in opposite directions.

Building on Mathematica's unified symbolic architecture, Mathematica 7 introduces several major new integrated forms of data manipulation—including large-scale support for ...

InDegree[g, n] returns the in-degree of vertex n in directed graph g. InDegree[g] returns the sequence of in-degrees of the vertices in directed graph g.

OutDegree[g, n] returns the out-degree of vertex n in directed graph g. OutDegree[g] returns the sequence of out-degrees of the vertices in directed graph g.

MinimumVertexCover[g] finds a minimum vertex cover of graph g.

GraphUnion[g_1, g_2, ...] constructs the union of graphs g_1, g_2, and so forth. GraphUnion[n, g] constructs n copies of graph g, for any nonnegative integer n.

CirculantGraph[n, l] constructs a circulant graph on n vertices, meaning the i\[Null]^th vertex is adjacent to the (i + j)\[Null]^th and (i - j)\[Null]^th vertices, for each ...

AllPairsShortestPath[g] gives a matrix, where the (i, j)\[Null]^th entry is the length of a shortest path in g between vertices i and j. AllPairsShortestPath[g, Parent] ...

KnightsTourGraph[m, n] returns a graph with mn vertices in which each vertex represents a square in an m*n chessboard and each edge corresponds to a legal move by a knight ...