Minimization of Boolean functions by undirected graph

In the article the method of minimization of Boolean function by undirected graph is considered. At present the following widely known methods are applied to minimization: analytical, Karnaugh map, Quine, Harvard, geometric. Undirected graph method allows to execute minimization of Boolean functions for a sufficiently large number of variables, it requires only creation of a graph the number of vertices easily is identified by the corresponding formulas and combine in geometrical figures of peaks for which the function refers to the logical unit.