(graph theory) A graph derived from a given plane graph such that this derived graph has a vertex corresponding to each edge of the given graph, and such that for every “angle” (consecutive trio of edge, vertex, edge) along the border of a face of the given graph there is a corresponding edge which connects the vertices corresponding to the two edges that are part of that “angle”.

(graph theory) A graph whose vertices all have the same degree.

(graph theory) A graph derived from some plane graph in such a way that the derived graph has a vertex corresponding to each face of the given graph, an edge corresponding to each edge of the given graph that is shared by a pair of distinct faces, and a self-loop for each edge of the given graph that is a border of the same face on both of its sides.

(mathematics) A graph (set of connected points) that has one vertex of degree at least three, and all other vertices of degree two or less

plural of spider graph

plural of crown graph

(graph theory) An undirected graph with 2n vertices in the two sets { u₁, u₂, ..., uₙ } and { v₁, v₂, ..., vₙ } and with an edge from uᵢ to vⱼ whenever i ≠ j.

Alternative spelling of streamgraph

plural of stream graph

plural of graph theory