Modeling Toroidal Networks with the Gaussian Integers

DOI10.1109/TC.2008.57MaRDI QIDQ4564058zbMATH OpenOpenAlexFDO

Authors Carmen Martínez, E. Stafford, Miquel Moretó, R. Beivide, E. M. Gabidulin

Publication date 12 June 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2008.57

Mathematics Subject Classification ID

General commutative ring theory (13A99) Network design and communication in computer systems (68M10)

Cited in

(10)

• Cyclotomic graphs and perfect codes
• Identifying codes of degree 4 Cayley graphs over abelian groups
• Dense bipartite circulants and their routing via rectangular twisted torus
• Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
• Tree connectivities of Cayley graphs on abelian groups with small degrees
• scientific article; zbMATH DE number 7310081 (Why is no real title available?)
• A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS
• Effective algorithm for finding shortest paths in dense Gaussian networks
• Database analysis of optimal double-loop networks
• Quotients of Gaussian graphs and their application to perfect codes

This page was built for publication: Modeling Toroidal Networks with the Gaussian Integers

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