This graph consists of two unit equilateral triangles joined at a common vertex-x.

This graph consists of two straight lines resembling a hockey-stick.

A graph, in general, consists of several vertices, some pairs connected by edges.

A graph of groups A consists of the following data:

The graph of a Hubbert curve consists of three key elements:

The graph consists of nodes (musical events) and edges (connections between events).

For the proof, assume that the graph consists of infinitely many vertices and is connected.

The graph actually consists of distinct points, and these points lie on line segments with discrete slopes.

If the final graph consists of a single node, then the original graph is said to be reducible.

A graph formally consists of a set of vertices and a set of edges between them.