The Manhattan product of digraphs
We give a formal definition of a new product of bipartite digraphs, the Manhattan product, and we study some of its main properties. It is shown that when all the factors of the above product are (directed) cycles, then the obtained digraph is the Manhattan street network. To this respect, it is pro...
| Authors: | , , |
|---|---|
| Format: | article |
| Publication Date: | 2007 |
| Country: | España |
| Institution: | Universitat Politècnica de Catalunya (UPC) |
| Repository: | UPCommons. Portal del coneixement obert de la UPC |
| Language: | English |
| OAI Identifier: | oai:upcommons.upc.edu:2117/1223 |
| Online Access: | https://hdl.handle.net/2117/1223 |
| Access Level: | Open access |
| Keyword: | Graph theory Digraph Bipartite Product Grafs, Teoria de Classificació AMS::05 Combinatorics::05C Graph theory |
| Summary: | We give a formal definition of a new product of bipartite digraphs, the Manhattan product, and we study some of its main properties. It is shown that when all the factors of the above product are (directed) cycles, then the obtained digraph is the Manhattan street network. To this respect, it is proved that many properties of such networks, such as high symmetries and the presence of Hamiltonian cycles, are shared by the Manhattan product of some digraphs. |
|---|