Constructing Graphs (Combinatorica Package Guide)

New in 8.0: Mathematics & Algorithms (Mathematica Guide)

Mathematica 8 adds major new areas, including probability and statistics, graphs and networks, computational finance, control systems, wavelet analysis, and group theory. ...

DegreeCentrality (Built-in Mathematica Symbol)

DegreeCentrality[g] gives a list of vertex degrees for the vertices in the underlying simple graph of g. DegreeCentrality[g, "InDegree"] gives a list of vertex ...

VertexOutDegree (Built-in Mathematica Symbol)

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

BipartiteGraphQ (Built-in Mathematica Symbol)

BipartiteGraphQ[g] yields True if the graph g is a bipartite graph and False otherwise.

VertexEccentricity (Built-in Mathematica Symbol)

VertexEccentricity[g, s] gives the length of the longest shortest path from the source s to every other vertex in the graph g.

EdgeIndex (Built-in Mathematica Symbol)

EdgeIndex[g, e] gives the integer index for the edge e in the graph g.

BreadthFirstScan (Built-in Mathematica Symbol)

BreadthFirstScan[g, s, {"event_1" -> f_1, "event_2" -> f_2, ...}] performs a breadth-first scan (bfs) of the graph g starting at the vertex s and evaluates f_i whenever ...

VertexDegree (Built-in Mathematica Symbol)

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

VertexInDegree (Built-in Mathematica Symbol)

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.