NoPerfectMatchingGraph returns a connected graph with 16 vertices that contains no perfect matching.
RealizeDegreeSequence[s] constructs a semirandom graph with degree sequence s.
StrongComponents[g] gives a list of all strongly connected components in the directed graph g.
VertexOutComponent[g, {v_1, v_2, ...}] gives the vertices in the graph g that have a directed path from at least one of v_1, v_2, ....VertexOutComponent[g, {v_1, v_2, ...}, ...
Weighted
(Graph Utilities Package Symbol) Weighted is an option to functions in the Graph Utilities Package that specifies how to treat edges with higher weight.
EdgeLabelStyle is an option and property for Graph and related functions that specifies the style to use for edge labels.
VertexLabelStyle is an option and property for Graph and related functions that specifies the style to use for vertex labels.
ChromaticNumber[g] gives the chromatic number of the graph, which is the fewest number of colors necessary to color the graph.
ReadGraph[f] reads a graph represented as edge lists from file f and returns a graph object.
DegreeSequence[g] gives the sorted degree sequence of graph g.