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

DOI10.1006/JPDC.2000.1624zbMath0953.68121OpenAlexW2019308532MaRDI QIDQ1577005

S. Lakshmivarahan, Fen Lin Wu, Sudarshan K. 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

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

Related Items (4)

Using semidirect products of groups to build classes of interconnection networks ⋮ Bound on the diameter of metacyclic groups ⋮ A new routing algorithm for the shuffle-exchange permutation network ⋮ On routing and diameter of metacyclic graphs

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