StarGraph[n] gives the star graph with n vertices S_n.

CirculantGraph[n, j] gives the circulant graph with n vertices and jump j C_n (j).CirculantGraph[n, {j_1, j_2, ...}] gives the circulant graph with n vertices and jumps j_1, ...

HypercubeGraph[n] gives the n-dimensional hypercube graph Q_n.

ButterflyGraph[n] gives the order-n butterfly graph. ButterflyGraph[n, b] gives the base-b order-n butterfly graph.

EulerianQ[g] yields True if graph g is Eulerian, meaning there exists a tour that includes each edge exactly once.

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.

VertexConnectivityGraph[g] returns a directed graph that contains an edge corresponding to each vertex in g and in which edge-disjoint paths correspond to vertex-disjoint ...

Conjunction[expr, {a_1, a_2, ...}] gives the conjunction of expr over all choices of the Boolean variables a_i.

PlanarGraphPlot[{{x_1, y_1}, {x_2, y_2}, ...}] plots the Delaunay triangulation of the points {{x_1, y_1}, ...}.PlanarGraphPlot[{{x_1, y_1}, {x_2, y_2}, ...}, g] plots the ...

Suppose two functions have the same domain and different ranges. Plotting them together using Plot uses the same scale for the y values. To compare the functions, TwoAxisPlot ...