Neighborhood[g, v, k] returns the subset of vertices in g that are at a distance of k or less from vertex v. Neighborhood[al, v, k] behaves identically, except that it takes ...

ParentsToPaths[l, i, j] takes a list of parents l and returns the path from i to j encoded in the parent list. ParentsToPaths[l, i] returns the paths from i to all vertices.

CompleteGraph[n] creates a complete graph on n vertices. An option Type that takes on the values Directed or Undirected is allowed. The default setting for this option is ...

HITSCentrality[g] gives a list of authority and hub centralities for the vertices in the graph g.

Eigenvectors[m] gives a list of the eigenvectors of the square matrix m. Eigenvectors[{m, a}] gives the generalized eigenvectors of m with respect to a. Eigenvectors[m, k] ...

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

GraphDistanceMatrix[g] gives the matrix of distances between vertices for the graph g.GraphDistanceMatrix[g, d] gives the matrix of distances between vertices of maximal ...

NetworkFlow[g, source, sink] returns the value of a maximum flow through graph g from source to sink. NetworkFlow[g, source, sink, Edge] returns the edges in g that have ...

OddGraph[n] returns the graph whose vertices are the size-(n - 1) subsets of a size-(2 nTraditionalForm\`\[Dash]1) set and whose edges connect pairs of vertices that ...

PageRankCentrality[g, \[Alpha]] gives a list of page-rank centralities for the vertices in the graph g and weight \[Alpha].PageRankCentrality[g, \[Alpha], \[Beta]] gives a ...