Dense bipartite circulants and their routing via rectangular twisted torus

DOI10.1016/j.dam.2013.09.021zbMath1283.05128OpenAlexW2033640003MaRDI QIDQ2636804

Pranava K. Jha

Publication date: 18 February 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.09.021

zbMATH Keywords

fault tolerancecirculant graphsnetwork topologymultiprocessor interconnectionrectangular twisted torus

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (1)

Tight-optimal circulants vis-à-vis twisted tori

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dense Gaussian networks: Suitable topologies for on-chip multiprocessors
• Isomorphism of circulant graphs and digraphs
• On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
• On planarity and colorability of circulant graphs
• A survey on multi-loop networks.
• Ádám's conjecture is true in the square-free case
• Cyclic graphs
• Vertex-colouring of 3-chromatic circulant graphs
• Circulants and their connectivities
• Perfect Codes for Metrics Induced by Circulant Graphs
• Reliable circulant networks with minimum transmission delay
• Minimal diameter double-loop networks. I. Large infinite optimal families
• Computing the Diameter in Multiple-Loop Networks
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Modeling Toroidal Networks with the Gaussian Integers
• PRODUCTS OF CIRCULANT GRAPHS
• Optimal distance networks of low degree for parallel computers

This page was built for publication: Dense bipartite circulants and their routing via rectangular twisted torus