graph theory

graph

vertex, edge

omega-graph, hypergraph

quiver, n-quiver

category of simple graphs

reflexive, directed

bipartite

planar

reflexivedirected graph + unital associative composition = category

ribbon graph, combinatorial map, topological map, child's drawing

vertex coloring, clique

Let $G = (V,E)$ be a simple, undirected graph. Then $G$ is said to be complete as a graph, if for every pair of vertices $(v_1,v_2) \in V \times V$, there exists a (unique) edge $e_{v_1,v_2} \in E$ between them.

Last revised on March 5, 2024 at 06:25:33. See the history of this page for a list of all contributions to it.