(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.

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

(geometry) Any of a certain family of graphs related to Keller's conjecture, such that the vertices of the Keller graph of dimension n are the 4ⁿ elements (m₁,...,mₙ) where each m is 0, 1, 2, or 3, and two vertices are joined by an edge if they differ in at least two coordinates and differ by exactly two in at least one coordinate.

(graph theory) A 3-regular graph with 28 vertices and 42 edges, one of the 13 known cubic distance-regular graphs.

(mathematics) Alternative form of graph-theoretical

Alternative form of braingraph

Alternative spelling of streamgraph

(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.

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

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