Aplicación de un algoritmo de reducción de grafos al Método de los Grafos Dicromáticos

this article proposes a mechanism for the decomposition of graphs representing mathematical models, in a way that preserves the relations between the vertices of the original graph. for this, we define the equivalence relations and partitions necessary for the application of a graph reduction algorithm to a graph obtained from the application of dichromatic graph method, this method has used in terms of rational design and computational problem solving in mechanical engineering. this proposal is a contribution to the analysis of mathematical models of large dimensions and facilitates the automation of that method.