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.

GraphCenter[g] gives a list of the vertices of graph g with minimum eccentricity.

GraphDifference[g, h] constructs the graph resulting from subtracting the edges of graph h from the edges of graph g.

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

GraphIntersection[g_1, g_2, ...] constructs the graph defined by the edges that are in all the graphs g_1, g_2, ....

GraphProduct[g_1, g_2, ...] constructs the product of graphs g_1, g_2, and so forth.

GraphSum[g_1, g_2, ...] constructs the graph resulting from joining the edge lists of graphs g_1, g_2, and so forth.

GrayCodeKSubsets[l, k] generates k-subsets of l in Gray code order.

GrayGraph returns a 3-regular, 54-vertex graph that is edge-transitive but not vertex-transitive\[LongDash]the smallest known such example.

GreedyVertexCover[g] returns a vertex cover of graph g constructed using the greedy algorithm. This is a natural heuristic for constructing a vertex cover, but it can produce ...