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}, ...}] ...
LinkRankMatrix[g] returns the link rank of the graph g, in the form of a sparse matrix. The link rank of an edge u -> v is defined as the PageRanks of u, divided by the ...
NeighborhoodVertices[g, i, r] gives vertices that can be reached from vertex i within r hops.NeighborhoodVertices[g, i] gives vertices that can be reached from vertex i.
PageRankVector[g] returns the page rank of the graph g.
HamiltonianCycles[g, n] gives a list of n Hamiltonian cycles.HamiltonianCycles[g] gives a list of one Hamiltonian cycle.
PrimitiveRoot[n] gives the smallest primitive root of n.
CommunityStructurePartition[g] gives the partition of a graph g into communities.
GraphPath[g, start, end] finds a shortest path between vertices start and end in graph g.
GraphPlot3D[{v i 1 -> v j 1, v i 2 -> v j 2, ...}] generates a 3D plot of the graph in which vertex v_ik is connected to vertex v_jk.GraphPlot3D[{{v i 1 -> v j 1, lbl_1}, ...
GraphDistance[g, i, j] gives the distance from vertex i to vertex j in the graph g.