Higher dimensional hexagonal networks

DOI10.1016/J.JPDC.2003.07.001MaRDI QIDQ1877642zbMATH OpenOpenAlexFDO

Authors Fabián García, Julio Solano, Ivan Stojmenović, Milos Stojmenović

Publication date 19 August 2004

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2003.07.001

zbMATH Keywords

AddressingHexagonal networksInterconnection networksRouting

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Honeycomb networks
• Routing on Triangles, Tori and Honeycombs
• scientific article; zbMATH DE number 1332755
• Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes
• Hexagonal models for channel routing

Cited in

(7)

• A family of efficient six-regular circulants representable as a Kronecker product
• The number of shortest paths in the (n, k)-star graph
• Honeycomb networks
• The number of shortest paths in the arrangement graph
• Application of neighborhood sequences in communication of hexagonal networks
• On minimum metric dimension of honeycomb networks
• Distance formula and shortest paths for the \((n,k)\)-star graphs

This page was built for publication: Higher dimensional hexagonal networks

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