Homomorphisms of (n,m)-graphs with respect to generalised switch

04/04/2022

∙

by   Sagnik Sen, et al.

∙

0

∙

share

An (n,m)-graph has n different types of arcs and m different types of edges. A homomorphism of an (n,m)-graph G to an (n,m)-graph H is a vertex mapping that preserves adjacency type and directions. Notice that, in an (n,m)-graph a vertex can possibly have (2n+m) different types of neighbors. In this article, we study homomorphisms of (n,m)-graphs while an Abelian group acts on the set of different types of neighbors of a vertex.