Binaargraafiku
Binaargraafiku is a term used in graph theory to describe a class of graphs whose vertices are labeled by binary strings and whose edges reflect binary relations among those strings. In many contexts, the vertex set consists of all binary strings of a fixed length n, and adjacency is defined by a rule based on bit differences, shifts, or other binary operations. These graphs are studied for their regular structure, symmetry, and applications in computing and coding theory.
A canonical example is the n-dimensional hypercube, denoted Qn. Its vertices correspond to binary strings of
Another important family is the binary De Bruijn graph B(2, n). It is a directed graph with
Related notions include Hamming graphs over binary alphabets and other state-space graphs built from binary representations.