%0 Journal Article
%T The Manhattan Product of Digraphs
%A F. Comellas
%A C. Dalfo
%A M.A. Fiol
%J Electronic Journal of Graph Theory and Applications
%D 2013
%I Indonesian Combinatorial Society (InaCombS), Graph Theory and Applications (GTA) Research Centre, The University of Newcastle, Australia, Institut Teknologi Bandung (ITB), Indonesia
%X We study the main properties of a new product of bipartite digraphs which we call Manhattan product. This product allows us to understand the subjacent product in the Manhattan street networks and can be used to built other networks with similar good properties. It is shown that if all the factors of such a product are (directed) cycles, then the digraph obtained is a Manhattan street network, a widely studied topology for modeling some interconnection networks. To this respect, it is proved that many properties of these networks, such as high symmetries, reduced diameter and the presence of Hamiltonian cycles, are shared by the Manhattan product of some digraphs. Moreover, we show that the Manhattan product of two Manhattan streets networks is also a Manhattan street network. Finally, some sufficient conditions for the Manhattan product of two Cayley digraphs to be also a Cayley digraph are given. Throughout our study we use some interesting recent concepts, such as the unilateral distance and related graph invariants.
%U http://ejgta.org/index.php/ejgta/article/view/15