Multiplicative circulant networks. Topological properties and communication algorithms

DOI10.1016/S0166-218X(96)00138-2zbMath0879.68080OpenAlexW2057679792MaRDI QIDQ1364475

Ivan Stojmenović

Publication date: 17 December 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

radix representationroutinginterconnection network topology

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Related Items (18)

A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ Fault-diameter of Cartesian graph bundles ⋮ Forwarding and optical indices of 4-regular circulant networks ⋮ Using semidirect products of groups to build classes of interconnection networks ⋮ The explicit identities for spectral norms of circulant-type matrices involving binomial coefficients and harmonic numbers ⋮ Mixed fault diameter of Cartesian graph bundles ⋮ Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles ⋮ NEW FAMILIES OF MULTIPLICATIVE CIRCULANT NETWORKS ⋮ The fault-diameter of Cartesian products ⋮ Unnamed Item ⋮ Wide diameter of Cartesian graph bundles ⋮ CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2) ⋮ Cube-connected circulants: bisection width, Wiener and forwarding indices ⋮ On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) ⋮ The edge fault-diameter of Cartesian graph bundles ⋮ Maximum induced subgraph of a recursive circulant ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Designing fault-tolerant systems using automorphisms
• Edge-colorability of graph bundles
• Minimal diameter double-loop networks: Dense optimal families
• On the number of spanning trees of circulant graphs
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Circulants and their connectivities
• Reliable circulant networks with minimum transmission delay
• A group-theoretic model for symmetric interconnection networks
• Routing Schemes for the Augmented Data Manipulator Network in an MIMD System
• Computing the Diameter in Multiple-Loop Networks
• Implementation of Permutation Functions in Illiac IV-Type Computers
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Some Complexity Results for Matrix Computations on Parallel Processors
• Isomorphism Classes of Graph Bundles
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• Data Manipulating Functions in Parallel Processors and Their Implementations
• Undirected loop networks
• Optimal distance networks of low degree for parallel computers
• The ILLIAC IV Computer
• Graphs with circulant adjacency matrices
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• A SIGNED BINARY MULTIPLICATION TECHNIQUE
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Multiplicative circulant networks. Topological properties and communication algorithms