Cycles in the cycle prefix digraph

Consultar RECERCAT

Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/805

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada I
dc.contributor	Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.contributor.author	Comellas Padró, Francesc de Paula
dc.contributor.author	Mitjana Riera, Margarida
dc.date	2000
dc.identifier.uri	http://hdl.handle.net/2117/805
dc.language.iso	eng
dc.rights	Attribution-NonCommercial-NoDerivs 2.5 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/2.5/es/
dc.subject	Graph theory
dc.subject	cycle prefix digraph
dc.subject	Grafs, Teoria de
dc.subject	Classificació AMS::05 Combinatorics::05C Graph theory
dc.title	Cycles in the cycle prefix digraph
dc.type	info:eu-repo/semantics/article
dc.description.abstract	Cycle prefix digraphs are a class of Cayley coset graphs with many remarkable properties such as symmetry, large number of nodes for a given degree and diameter, simple shortest path routing, Hamiltonicity, optimal connectivity, and others. In this paper we show that the cycle prefix digraphs, like the Kautz digraphs, contain cycles of all lengths l, with l between two and N, the order of the digraph, except for N-1.

Comellas Padró, Francesc de Paula; Fiol Mora, Miquel Àngel; Gimbert, Joan; Mitjana Riera, Margarida

Comellas Padró, Francesc de Paula; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Mitjana Riera, Margarida

Amell, A.; Roso Llorach, Albert; Palomero, L.; Comellas Padró, Francesc de Paula

Xie, Pinchen; Zhang, Zhongzhi; Comellas Padró, Francesc de Paula

Comellas Padró, Francesc de Paula; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel

Coordinación

Patrocinio