The multidimensional Manhattan networks
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/675
Tipus de documentArticle
Data publicació2007
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-SenseObraDerivada 2.5 Espanya
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.
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
manhattan(SIDMA).pdf | 676,5Kb | Visualitza/Obre |