AcyclicGraphQ[g] yields True if the graph g is an acyclic graph and False otherwise.
CayleyGraph[group] returns a Cayley graph representation of group.
Mathematica 's differential equation solving functions can be applied to many different classes of differential equations, automatically selecting the appropriate algorithms ...
UniformGraphDistribution[n, m] represents a uniform graph distribution on n-vertex, m-edge graphs.
UndirectedGraph[g] gives an undirected graph from the directed graph g.
GraphDifference[g_1, g_2] gives the graph difference of the graphs g_1 and g_2.
ClosenessCentrality[g] finds the closeness centrality.
Building on Mathematica's unique base of visualization and graphics capabilities, Mathematica 7 adds several important new areas. Emphasizing integration and automation, ...
VertexWeight is an option and property for Graph and related functions that specifies a vertex weight.
TreePlot lays out the vertices of a graph in a tree of successive layers, or a collection of trees. If the graph g is not a tree, TreePlot lays out its vertices on the basis ...