(mathematics) A graph consisting of two rows of paired nodes in which all nodes except the paired ones are connected with straight lines; it is the complement of the ladder graph, and the dual graph of the hypercube.

(graph theory, computer science) A finite directed graph that contains no directed cycles.

(graph theory) A kind of directed graph representing overlaps between sequences of symbols.

plural of algebraic graph theory

(uncountable, mathematics, graph theory) The subbranch of graph theory in which algebraic methods are applied to problems about graphs.

(graph theory) A biclique, a bipartite graph such that every vertex of one set is connected to every vertex of the other.

(graph theory) A graph (set of connected points) in which each vertex corresponds to a convex polygon circumscribed in a common circle, and in which (graph) vertices are adjacent iff their corresponding polygons intersect geometrically.

(programming) A data structure that represents a set of strings and allows for a query operation that tests whether a given string belongs to the set in time proportional to its length (thus more efficient in some situations than a trie).