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

DOI10.1017/S0004972717000028zbMATH Open1402.05099MaRDI QIDQ5269731FDOQ5269731

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

• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Title not available (Why is that?)
• On forwarding indices of networks
• FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR
• LATIN 2004: Theoretical Informatics
• Efficient collective communciation in optical networks
• Recursive cubes of rings as models for interconnection networks
• Forwarding and optical indices of 4-regular circulant networks

Cited In (1)

• Exact upper bound for sorting Rn 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)