A complete graph of order 3 is called a triangle.

A topological graph is also called a drawing of a graph.

Any directed graph constructed this way is called an "oriented graph".

If any two nodes have an edge between them, then the graph is called the complete graph.

Such a graph is called a complete graph (because there cannot be any more edges).

A graph is called prime if all of its modules are trivial.

If such a path exists, the graph is called traversable or semi-eulerian.

If such a cycle exists, the graph is called Eulerian or unicursal.

A graph that allows any hyperedge is called a hypergraph.

Such a graph is sometimes also called 1-arc-transitive or flag-transitive.