VertexInDegree[g] gives the list of vertex in-degrees for all vertices in the graph g.VertexInDegree[g, v] gives the vertex in-degree for the vertex v.

BetweennessCentrality[g] gives a list of betweenness centralities for the vertices in the graph g.

PermuteSubgraph[g, p] permutes the vertices of a subgraph of g induced by p according to p.

Wheel[n] constructs a wheel on n vertices, which is the join of CompleteGraph[1] and Cycle[n - 1].

Mathematica 6.0 represented a major new level in Mathematica's distinguished twenty-year history of broad cutting-edge algorithm development. Mathematica's unified ...

ShowGraphArray[{g_1, g_2, ...}] displays a row of graphs. ShowGraphArray[{{g_1, ...}, {g_2, ...}, \ ...}] displays a two-dimensional table of graphs.

DepthFirstTraversal[g, v] performs a depth-first traversal of graph g starting from vertex v, and gives a list of vertices in the order in which they were encountered. ...

FromAdjacencyLists[l] constructs an edge list representation for a graph from the given adjacency lists l, using a circular embedding. FromAdjacencyLists[l, v] uses v as the ...

Bridges[g] gives a list of the bridges of graph g, where each bridge is an edge whose removal disconnects the graph.

GraphPower[g, k] gives the k\[Null]^th power of graph g. This is the graph whose vertex set is identical to the vertex set of g and that contains an edge between vertices i ...