Особливості матричного виконання деяких бінарних операцій над довільними графами

Graph theory has a wide range of practical applications. Graphs play an important role in scientific research (e.g., electrical circuits) and also surround us in everyday life (e.g., road and path maps). For everyday use, the geometric implementation of graphs is certainly the most convenient. But for computer information processing, this is not rational. In these cases, algebraic, namely matrix representation of graphs is used. Therefore, research devoted to this topic is becoming increasingly important. This article proves the possibility of algebraically performing some binary operations on adjacency matrices representing graphs. These methods have their own peculiarities and limitations, which are emphasized in this article.