Finding optimal routings in Hamming graphs

DOI10.1006/EUJC.2002.0617zbMath1012.05097OpenAlexW2161184802WikidataQ56987940 ScholiaQ56987940MaRDI QIDQ1864615

Tian Khoon Lim, Cheryl E. Praeger

Publication date: 18 March 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.2002.0617

zbMATH Keywords

orbital regular graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (4)

Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes ⋮ Gossiping and routing in second-kind Frobenius graphs ⋮ Gossiping and routing in undirected triple-loop networks ⋮ Rotational circulant graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular maps from Cayley graphs. I: Balanced Cayley maps
• Geometric bounds for eigenvalues of Markov chains
• The edge-forwarding index or orbital regular graphs
• Skew-morphisms of regular Cayley maps
• On orbital regular graphs and Frobenius graphs
• Complete rotations in Cayley graphs

This page was built for publication: Finding optimal routings in Hamming graphs