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.

GraphicQ[s] yields True if the list of integers s is a graphic sequence, and thus represents a degree sequence of some graph.

LabeledTreeToCode[g] reduces the tree g to its Prüfer code.

MakeSimple[g] gives the undirected graph, free of multiple edges and self-loops derived from graph g.

MaximalMatching[g] gives the list of edges associated with a maximal matching of graph g.

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 {}.

MinimumVertexCover[g] finds a minimum vertex cover of graph g.

M[g] gives the number of edges in the graph g. M[g, Directed] is obsolete because M[g] works for directed as well as undirected graphs.