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

DOI10.1017/S0004972717000028zbMath1402.05099MaRDI QIDQ5269731

Hamid Mokhtar

Publication date: 27 June 2017

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

zbMATH Keywords

shortest pathCayley graphdiameterroutingWiener indexinterconnection networkcirculant graphbisection widthedge-forwarding indexvertex-forwarding indexcube-connected cycle

Mathematics Subject Classification ID

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

Related Items (1)

Exact upper bound for sorting Rn with LE

Cites Work

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

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