Now showing items 6-7 of 7

    • Isomorfismo de Conjuntos de Relaciones 

      Bulat, Mijail (2012-04-26)
      It is recommended to use a solving method for relations sets in order to solve the isomorphism problem. This method allows to solve the same problem for big size graphs, homogeneous graphs, graph systems, k-signs logic ...
    • On the Distribution of non-attacking Bishops on a Chessboard C 

      Ansari Wahid, Shanaz (2012-04-26)
      It is shown how the placement of non-attacking bishops on a chessboard C is related to the matching polynomial of a bipartite graph. Reduction algorithms for finding the bishop polynomial of C are given. We interpret ...