Mostra el registre d'ítem simple
Ciclos de Hamilton en redes de paso commutativo y de paso fijo
dc.contributor.author | Fiol Mora, Miquel Àngel |
dc.contributor.author | Yebra, José Luis A. |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV |
dc.date.accessioned | 2008-06-23T14:56:42Z |
dc.date.available | 2008-06-23T14:56:42Z |
dc.date.created | 1988 |
dc.date.issued | 1988 |
dc.identifier.citation | Fiol, M.A.; Yebra, J.L.A. Ciclos de Hamilton en redes de paso commutativo y de paso fijo. Stochastica, 1988, XII-2-3, p. 113-129. |
dc.identifier.issn | 0210-7821 |
dc.identifier.uri | http://hdl.handle.net/2117/2106 |
dc.description.abstract | From a natural generalization to $Z^2$ of the concept of congruence, it is possible to define a family of $2$-regular digraphs that we call "commutative-step networks". Particular examples of such digraphs are the Cartesian product of two directed cycles, $C_l\times C_h$, and the "fixed-step network" (or "$2$-step circulant digraph") $D_{N,a,b}$. In this paper the theory of congruence in $Z^2$ is applied to derive three equivalent characterizations of those commutative-step networks that have a Hamiltonian cycle. Some known results are then obtained as a corollary. For instance, necessary and sufficient conditions for C_l\times C_h$ or $D_{N,a,b}$ to be Hamiltonian are discussed. |
dc.format.extent | 17 p. |
dc.language.iso | spa |
dc.publisher | Universidad de Barcelona, Departamento de Estadística Matemática;Universidad Politécnica de Barcelona, Escuela Técnica Superior de Arquitectura, Departamento de Matemáticas y Estadística |
dc.subject.lcsh | Graph theory |
dc.subject.other | Digrafo |
dc.subject.other | Redes de paso commutativo |
dc.subject.other | Ciclo de Hamilton |
dc.subject.other | Congruencias en $Z^2$ |
dc.title | Ciclos de Hamilton en redes de paso commutativo y de paso fijo |
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.description.peerreviewed | Peer Reviewed |
dc.subject.ams | Classificació AMS::05 Combinatorics::05C Graph theory |
dc.rights.access | Open Access |
local.personalitzacitacio | true |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.227]
-
Articles de revista [290]