Isomorfismo de grafos y de funciones lógicas con algunas aplicaciones

Abstract

A method to solve the isomorphism problem for graphs is suggested, which significantly decreases the number of variants to be checked. Based on the substitution of two successions, the necessary and sufficient conditions are given for the existence of the isomorphism. The method is applicable to any graphs (directed, undirected, weighted etc.) and hypergraphs. With some modifications it can be applied for solving isomorphism problem for logical functions. Some applications are considered:

   1. search for hamiltonian cycles (paths)
   2. solutions of the Frobenius problem for strongly equivalent matrices,
   3. conding inside states of the finite automate.