Hamilton cycles in Trivalent Cayley graphs

DOI10.1016/S0020-0190(96)00158-5zbMATH Open0900.68075OpenAlexW2152795801MaRDI QIDQ673339FDOQ673339

Authors: Meghanad D. Wagh, Jiancheng Mo 

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

Recommendations

• scientific article; zbMATH DE number 3908475
• Publication:5753983
• Hamiltonian cycles in Cayley graphs whose order has few prime factors
• A survey: Hamiltonian cycles in Cayley graphs
• Hamilton cycles in (2, odd, 3)-Cayley graphs

zbMATH Keywords

Cayley graphsInterconnection networksParallel algorithmsMappingComputer architecture

Mathematics Subject Classification ID

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

Cites Work

• A group-theoretic model for symmetric interconnection networks
• Title not available (Why is that?)
• Trivalent Cayley graphs for interconnection networks
• Generalized de Bruijn digraphs
• The Hamiltonian property of generalized de Bruijn digraphs
• An algebraic analysis of the connectivity of De Bruijn and shuffle- exchange digraphs
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI

Cited In (8)

• On the pagenumber of trivalent Cayley graphs
• Title not available (Why is that?)
• Optimal layout of trivalent Cayley interconnection networks
• Hamilton circles in Cayley graphs
• Hamiltonian cycles in normal Cayley graphs
• A canonical representation of trivalent hamiltonian graphs
• Hamiltonian cycles in T-graphs
• Title not available (Why is that?)

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

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