On routing and diameter of metacyclic graphs

DOI10.1080/00207160801965222zbMATH Open1159.68026OpenAlexW2044578653MaRDI QIDQ3603582FDOQ3603582

Authors: Wenjun Xiao, Behrooz Parhami 

Publication date: 18 February 2009

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160801965222

Recommendations

• Routing in a class of Cayley graphs of semidirect products of finite groups
• Multiplicative circulant networks. Topological properties and communication algorithms
• Representations and routing for Cayley graphs (computer networks)
• Cycle prefix digraphs for symmetric interconnection networks
• scientific article; zbMATH DE number 434694

zbMATH Keywords

Cayley graphrouting algorithmmetacyclic graphnetwork diameterinternode distance

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• A group-theoretic model for symmetric interconnection networks
• Title not available (Why is that?)
• Group Action Graphs and Parallel Architectures
• Representations and routing for Cayley graphs (computer networks)
• Routing in a class of Cayley graphs of semidirect products of finite groups

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: On routing and diameter of metacyclic graphs

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