Construction of Hamiltonian circuits in Cayley graphs modeling multiprocessing computer systems

DOI10.1023/A:1020456931368zbMATH Open1067.68106OpenAlexW8367854MaRDI QIDQ1778777

P. P. Parkhomenko

Publication date: 17 June 2005

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020456931368

zbMATH Keywords

binary hypercubesedge representation of circuits

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Processor interconnection networks from Cayley graphs ⋮ Computational and Information Science

This page was built for publication: Construction of Hamiltonian circuits in Cayley graphs modeling multiprocessing computer systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1778777)