Pancyclicity of OTIS (swapped) networks based on properties of the factor graph

DOI10.1016/j.ipl.2011.07.020zbMath1260.68301OpenAlexW1969967524WikidataQ57835273 ScholiaQ57835273MaRDI QIDQ1944216

Yanyan Li

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.07.020

zbMATH Keywords

Hamiltonian cycleparallel processingpancyclicityOTIS (swapped) networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Dominating problems in swapped networks ⋮ On pancyclicity properties of OTIS-mesh

Cites Work

• Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements
• Pancyclism and bipancyclism of Hamiltonian graphs
• On pancyclicity properties of OTIS-mesh
• The \(m\)-pancycle-connectivity of a WK-recursive network
• Pancyclic graphs. I
• Scalable network architectures using the optical transpose interconnection system (OTIS)

This page was built for publication: Pancyclicity of OTIS (swapped) networks based on properties of the factor graph