DirectedEdges is an option for Graph, GraphPlot, and related functions that specifies whether edges should be taken to be directed.
PseudoDiameter[g] give the pseudo-diameter of the undirected graph g, and the two vertices that achieve this diameter.
GraphCenter[g] gives the set of vertices with minimum eccentricity in the graph g.
GraphPeriphery[g] gives the set of vertices with maximum eccentricity in the graph g.
ClosenessCentrality[g] finds the closeness centrality.
HighlightGraph[g, {a_1, a_2, ...}] highlights the a_i that can be vertices, edges, or subgraphs of g.HighlightGraph[g, {..., w_j[a_j], ...}] highlights using the symbolic ...
UniformGraphDistribution[n, m] represents a uniform graph distribution on n-vertex, m-edge graphs.
NeighborhoodGraph[g, v] gives the graph neighborhood vertex v in the graph g. NeighborhoodGraph[g, {a_1, a_2, ...}] gives the graph neighborhood of the a_i that can be ...
DegreeGraphDistribution[dlist] represents a degree graph distribution with vertex degree dlist.
TreeGraphQ[g] yields True if the graph g is a tree and False otherwise.