(graph theory) A complete multipartite graph T(n,r) formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and connecting two vertices by an edge if and only if they belong to different subsets.

plural of Turán graph

(information science) A knowledge base with an interlinked graph structure.

(mathematics) A bipartite graph used to state constraints or equations which specify error-correcting codes, used to construct longer codes from smaller ones.

plural of factor graph

plural of Tanner graph

(mathematics) A bipartite graph representing the factorization of a function.

(graph theory) The graph K_(3,3), which has six vertices in two sets of three and nine edges such that every vertex in one set is connected to each vertex in the other.

plural of utility graph

A graph that represents social relations between entities.