Routing in a class of Cayley graphs of semidirect products of finite groups

DOI10.1006/JPDC.2000.1624MaRDI QIDQ1577005zbMATH OpenOpenAlexFDO

Authors Fen Lin Wu, S. Lakshmivarahan, Sudarshan Dhall

Publication date 27 August 2000

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.2000.1624

zbMATH Keywords

Cayley graphsinterconnection networks

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Using semidirect products of groups to build classes of interconnection networks
• Class-congruence property and two-phase routing of Borel Cayley graphs
• Representations and routing for Cayley graphs (computer networks)
• On routing and diameter of metacyclic graphs
• scientific article; zbMATH DE number 1054728

Cited in

(6)

• Using semidirect products of groups to build classes of interconnection networks
• A new routing algorithm for the shuffle-exchange permutation network
• On routing and diameter of metacyclic graphs
• Representations of Borel Cayley Graphs
• Class-congruence property and two-phase routing of Borel Cayley graphs
• Bound on the diameter of metacyclic groups

This page was built for publication: Routing in a class of Cayley graphs of semidirect products of finite groups

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