Distances[g, v] returns the distances in nondecreasing order from vertex v to all vertices in g, treating g as an unweighted graph.

EdgeLabelPosition is an option that allows the user to place an edge label in a certain position relative to the midpoint of the edge. LowerLeft is the default value of this ...

GetEdgeLabels[g] returns the list of labels of the edges of g. GetEdgeLabels[g, e] returns the list of labels in graph g of the edges in e.

GetEdgeWeights[g] returns the list of weights of the edges of g. GetEdgeWeights[g, e] returns the list of weights in graph g of the edges in e.

GetVertexLabels[g] returns the list of labels of vertices of g. GetVertexLabels[g, v] returns the list of labels in graph g of the vertices specified in list v.

GetVertexWeights[g] returns the list of weights of vertices of g. GetVertexWeights[g, v] returns the list of weights in graph g of the vertices in v.

GraphOptions[g] returns the display options associated with g. GraphOptions[g, v] returns the display options associated with vertex v in g. GraphOptions[g, {u, v}] returns ...

HamiltonianQ[g] yields True if there exists a Hamiltonian cycle in graph g, or in other words, if there exists a cycle that visits each vertex exactly once.

LexicographicSubsets[l] gives all subsets of set l in lexicographic order. LexicographicSubsets[n] returns all subsets of {1, 2, ..., n} in lexicographic order.

MaximumClique[g] finds a largest clique in graph g. MaximumClique[g, k] returns a k-clique, if such a thing exists in g; otherwise it returns {}.