Abstract:
An algorithm of construction of some subgraph of bifurcation graph for symmetrical systems of equations is reported in the paper. It is proved also that the subgraph contains one and only one representative from every equivalence class of complete bifurcation routes. One more algorithm is developed which is more effectively deletes conjugate structures.