Source: wikibot/diamond-graph
= Diamond graph
{wiki=Diamond_graph}
A diamond graph is a specific type of graph in graph theory, characterized by its structure resembling a diamond shape. Formally, a diamond graph is a type of bipartite graph, denoted as \\( K_\{2,2\} \\), which consists of two disjoint sets of vertices with two vertices in each set, and each vertex from one set is connected to both vertices in the other set.