Building on Mathematica's unique base of visualization and graphics capabilities, Mathematica 7 adds several important new areas. Emphasizing integration and automation, ...

HITSCentrality[g] gives a list of authority and hub centralities for the vertices in the graph g.

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

FunctionalGraph[f, v] takes a set v and a function f from v to v and constructs a directed graph with vertex set v and edges (x, f[x]) for each x in v. FunctionalGraph[{f_1, ...

AddVertex[g] adds one disconnected vertex to graph g. AddVertex[g, v] adds to g a vertex with coordinates specified by v.

ApproximateVertexCover[g] produces a vertex cover of graph g whose size is guaranteed to be within twice the optimal size.

ChvatalGraph returns a smallest triangle-free, 4-regular, 4-chromatic graph.

DeleteVertex[g, v] deletes a single vertex v from graph g. Here v is a vertex number.

DeleteVertices[g, vList] deletes vertices in vList from graph g. vList has the form {i, j, ...}, where i, j, ... are vertex numbers.

ExactRandomGraph[n, e] constructs a random labeled graph of exactly e edges and n vertices.