Author

Comellas Padró, Francesc

Dalfó, Cristina

Fiol Mora, Miguel Ángel

Publication date

2019-02-04T08:33:32Z

2019-02-04T08:33:32Z

2013



Abstract

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.


This research was supported by the Ministry of Science and Innovation (Spain) and the European Regional Development Fund under project MTM2011-28800-C02-01-1 and by the Catalan Research Council under project 2009SGR1387.

Document Type

Article
Published version

Language

English

Subjects and keywords

Self-converse digraph; Manhattan street network; Unilateral diameter; Cayley digraph

Publisher

Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia

Related items

info:eu-repo/grantAgreement/MICINN//MTM2011-28800-C02-01/ES/OPTIMIZACION Y PROBLEMAS EXTREMALES EN TEORIA DE GRAFOS Y COMBINATORIA. APLICACIONES A LAS REDES DE COMUNICACION/

Reproducció del document publicat a https://doi.org/10.5614/ejgta.2013.1.1.2

Electronic Journal of Graph Theory and Applications, 2013, vol. 1, núm. 1, p. 11–27

Rights

cc-by-sa (c) F. Comellas et al., 2013

http://creativecommons.org/licenses/by-sa/4.0/

This item appears in the following Collection(s)