Mostra el registre d'ítem simple
The multidimensional Manhattan networks
dc.contributor.author | Comellas Padró, Francesc de Paula |
dc.contributor.author | Dalfó Simó, Cristina |
dc.contributor.author | Fiol Mora, Miquel Àngel |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV |
dc.date.accessioned | 2007-03-13T19:07:03Z |
dc.date.available | 2007-03-13T19:07:03Z |
dc.date.issued | 2007 |
dc.identifier.uri | http://hdl.handle.net/2117/675 |
dc.description.abstract | The $n$-dimensional Manhattan network $M_n$---a special case of $n$-regular digraph---is formally defined and some of its structural properties are studied. In particular, it is shown that $M_n$ is a Cayley digraph, which can be seen as a subgroup of the $n$-dim version of the wallpaper group $pgg$. These results induce a useful new presentation of $M_n$, which can be applied to design a (shortest-path) local routing algorithm and to study some other metric properties. Also it is shown that the $n$-dim Manhattan networks are Hamiltonian and, in the standard case (that is, dimension two), they can be decomposed in two arc-disjoint Hamiltonian cycles. Finally, some results on the connectivity and distance-related parameters of $M_n$, such as the distribution of the node distances and the diameter are presented. |
dc.language.iso | eng |
dc.rights | Attribution-NoDerivs 2.5 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nd/2.5/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
dc.subject.lcsh | Representations of graphs |
dc.subject.other | Manhattan street network |
dc.subject.other | Cayley digraph |
dc.subject.other | diameter |
dc.subject.other | Hamiltonian cycle |
dc.title | The multidimensional Manhattan networks |
dc.type | Article |
dc.subject.lemac | Grafs, Teoria de |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.subject.ams | Classificació AMS::05 Combinatorics::05C Graph theory |
dc.rights.access | Open Access |
dc.relation.projectidctt | MTM2005-08990-C02-01 |
dc.relation.projectidctt | TEC2005-03575 |
local.personalitzacitacio | true |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.234]
-
Articles de revista [290]