TreePlot[{v i 1 -> v j 1, v i 2 -> v j 2, ...}] generates a tree plot of the graph in which vertex v_ik is connected to vertex v_jk.TreePlot[{{v i 1 -> v j 1, lbl_1}, ...}] ...
LayeredGraphPlot attempts to draw the vertices of a graph in a series of layers, placing dominant vertices at the top, and vertices lower in the hierarchy progressively ...
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 ...
GraphPlot[{v i 1 -> v j 1, v i 2 -> v j 2, ...}] generates a plot of the graph in which vertex v_ik is connected to vertex v_jk.GraphPlot[{{v i 1 -> v j 1, lbl_1}, ...}] ...
CommunityStructureAssignment[g] gives the assignment of vertices of a graph g into communities.
GraphPath[g, start, end] finds a shortest path between vertices start and end in graph g.
TreeForm[expr] displays expr as a tree with different levels at different depths. TreeForm[expr, n] displays expr as a tree only down to level n.
DOT
(Mathematica Import/Export Format) DOT graph language and data format. Commonly used exchange format for graphs. Stores a single attributed, directed, or undirected graph. Can contain user-defined graph, edge, ...
GraphPlot functionality is now available in the newly added built-in Mathematica kernel functions GraphPlot and LayeredGraphPlot. GraphPlot3D is now available as the newly ...
DIMACS
(Mathematica Import/Export Format) DIMACS graph data format. Commonly used exchange format for graphs. Stores a single undirected graph. Plain text or binary format. DIMACS is an acronym derived from Discrete ...