A class of hierarchical graphs as topologies for interconnection networks

DOI10.1016/J.TCS.2010.04.022zbMath1192.68045OpenAlexW2076953933MaRDI QIDQ982664

Pao-Lien Lai, Iain A. Stewart, Hong-Chun Hsu, Chang-Hsiung Tsai

Publication date: 7 July 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/6701/1/6701.pdf

zbMATH Keywords

diameterconnectivityhypercubesroutingbroadcastinghierarchical interconnection networkscrossed cubestwisted cubesMöbius cubeshierarchical crossed cubes

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68M99)

Related Items (3)

Multiswapped networks and their topological and algorithmic properties ⋮ Recursive cubes of rings as models for interconnection networks ⋮ Cube-connected circulants: bisection width, Wiener and forwarding indices

Cites Work

• Unnamed Item
• Connectivity of the crossed cube
• Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
• Topological properties of twisted cube
• The hierarchical cliques interconnection network
• An oblivious shortest-path routing algorithm for fully connected cubic networks
• Neighborhood Broadcasting in Hypercubes
• A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• The Mobius cubes

This page was built for publication: A class of hierarchical graphs as topologies for interconnection networks