Hamilton cycles in Trivalent Cayley graphs

DOI10.1016/S0020-0190(96)00158-5zbMath0900.68075OpenAlexW2152795801MaRDI QIDQ673339

Jiancheng Mo, Meghanad D. Wagh

Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00158-5

zbMATH Keywords

Cayley graphsParallel algorithmsMappingInterconnection networksComputer architecture

Mathematics Subject Classification ID

Computer system organization (68M99) Distributed algorithms (68W15)

Related Items (2)

On the pagenumber of trivalent Cayley graphs ⋮ OPTIMAL LAYOUT OF TRIVALENT CAYLEY INTERCONNECTION NETWORKS

Cites Work

• Unnamed Item
• Trivalent Cayley graphs for interconnection networks
• The Hamiltonian property of generalized de Bruijn digraphs
• An algebraic analysis of the connectivity of De Bruijn and shuffle- exchange digraphs
• Generalized de Bruijn digraphs
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• A group-theoretic model for symmetric interconnection networks

This page was built for publication: Hamilton cycles in Trivalent Cayley graphs