The Isomorphism of Some Eulerian Graph Models Due to the Algebraic Properties of the (132)-Avoiding Class of Aunu Permutation Patterns

In this article, the three Eulerian Graph models obtained from the adjacency tables (matrix) of the subsets of , the (132)- avoiding class of AUNU permutation patterns are examined as regard to whether they are Isomorphic or not. Two Graphs are said to be Isomorphic to each other if there exist a one to one correspondence between their vertices sets say and also between their edges sets say such that incidence relationship is preserved and written as. We first disregard the order of these graph models and consider them as undirected graphs. Next, the four basic requirements (conditions) for Isomorphism are now verified on these graph models to finally ascertain whether the said graph models are Isomorphic or otherwise.