A FEW FAMILIES OF CAYLEY GRAPHS AND THEIR EFFICIENCY AS COMMUNICATION NETWORKS

DOI10.1017/S0004972717000028MaRDI QIDQ5269731zbMATH OpenFDO

Authors Hamid Mokhtar

Publication date 27 June 2017

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

Cayley graphdiametershortest pathinterconnection networkroutingWiener indexcirculant graphbisection widthedge-forwarding indexvertex-forwarding indexcube-connected cycle

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Communication networks in operations research (90B18)

Cites work

• scientific article; zbMATH DE number 1054728 (Why is no real title available?)
• Efficient collective communciation in optical networks
• FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR
• Forwarding and optical indices of 4-regular circulant networks
• LATIN 2004: Theoretical Informatics
• On forwarding indices of networks
• Recursive cubes of rings as models for interconnection networks
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey

Cited in

(1)

• Exact upper bound for sorting \(R_n\) with LE

This page was built for publication: A FEW FAMILIES OF CAYLEY GRAPHS AND THEIR EFFICIENCY AS COMMUNICATION NETWORKS

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