GraphIntersection[g_1, g_2] gives the graph intersection of the graphs g_1 and g_2.GraphIntersection[g_1, g_2, ...] gives the graph intersection of g_1, g_2, ....
ReverseGraph[g] gives the reverse graph of the directed g.
TGF
(Mathematica Import/Export Format) TGF graph data format. Used for the storage and exchange of graphs. TGF is an acronym for Trivial Graph Format. Stores directed graphs. Stores at most one label per vertex ...
BipartiteGraphQ[g] yields True if the graph g is a bipartite graph and False otherwise.
BooleanGraph[bfunc, g_1, ..., g_n] gives the Boolean graph defined by the Boolean function bfunc on the graphs g_1, ..., g_n.
GraphUnion[g_1, g_2] gives the graph union of the graphs g_1 and g_2.GraphUnion[g_1, g_2, ...] gives the graph union of g_1, g_2, ....
RectangleChart[{{x_1, y_1}, {x_2, y_2}, ...}] makes a rectangle chart with bars of width x_i and height y_i. RectangleChart[{..., w_i[{x_i, y_i}, ...], ..., w_j[{x_i, y_j}, ...
CycleGraph[n] gives the cycle graph with n vertices C_n.
PseudoDiameter[g] give the pseudo-diameter of the undirected graph g, and the two vertices that achieve this diameter.
IsomorphicGraphQ[g_1, g_2] yields True if the graphs g_1 and g_2 are isomorphic, and False otherwise.