Dense bipartite circulants and their routing via rectangular twisted torus

DOI10.1016/J.DAM.2013.09.021MaRDI QIDQ2636804zbMATH OpenOpenAlexFDO

Authors 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

circulant graphsfault tolerancemultiprocessor interconnectionnetwork topologyrectangular twisted torus

Mathematics Subject Classification ID

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

Recommendations

• Vertex disjoint routings of cycles over tori
• Circuits in graphs embedded on the torus
• Tight-optimal circulants vis-à-vis twisted tori
• scientific article; zbMATH DE number 1034103
• Regular connected bipancyclic spanning subgraphs of torus networks
• Routing numbers of cycles, complete bipartite graphs, and hypercubes
• Adaptive routing for n-Dimensional Twin torus
• Edge-disjoint circuits in graphs on the torus
• Optimal routing in toroidal networks
• Decomposing toroidal graphs into circuits and edges

Cites work

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

Cited in

(4)

• Tight-optimal circulants vis-à-vis twisted tori
• The diameter of rectangular twisted torus
• Database analysis of optimal double-loop networks
• Discovery of infinite families of optimal double-loop networks with a given template of generators

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

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