We propose a new approach to solve graph isomorphism using parameterized matching. To find isomorphism between two graphs, one graph is linearized, i.e., represented as a graph walk that covers all ...

This example: python3 main.py -i torus24.grl -c 1 will compute the number of automorphism for the graphs found in the provided file.

Abstract: The identification and enumeration of small, non-isomorphic graphs, called graphlets, within larger graphs is an analytic tool used for graph analytics. The problem of identifying graphlets ...

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also ...

ABSTRACT: To effectively evaluate a system that performs operations on UML class diagrams, it is essential to cover a large variety of different types of diagrams. The coverage of the diagram space ...