(graph theory) A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).

(graph theory) A graph in which the edges are ordered pairs, so that, if the edge (a, b) is in the graph, the edge (b, a) need not be in the graph and is distinct from (a, b) if it is.

(mathematics) Relating to or using graph theory.

(uncountable, mathematics) The branch of mathematics dealing with the properties of graphs (networks of vertices and edges).

(graph theory) A graph where every pair of vertices is connected by an edge.

(graph theory) A mathematician or computer scientist who specializes in graph theory

plural of graph theorist

A subtree in a graph consisting of an internal node with exactly two leaves.

(mathematics) In a manner which uses graph theory / (mathematics) In the sense of graph theory

A graph (collection of vertices and edges) encoding information about a group and its generators.