MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS

DOI10.1142/S0129054109006978zbMath1186.68332OpenAlexW2048626651MaRDI QIDQ3646175

Tatjana Davidović, Dragos Cvetković

Publication date: 19 November 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054109006978

zbMATH Keywords

graph invariantsmultiprocessor systemsspectra of graphsinterconnection topologies

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Mathematical problems of computer architecture (68M07) Distributed systems (68M14)

Related Items (6)

Graphs for small multiprocessor interconnection networks ⋮ On the Laplacian spectrum of \(k\)-symmetric graphs ⋮ Spectral analysis of weighted neighborhood networks ⋮ Graph spectra in computer science ⋮ Integral Laplacian graphs with a unique repeated Laplacian eigenvalue. I ⋮ Laplacian integrality in \(P_4\)-sparse and \(P_4\)-extendible graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A table of connected graphs on six vertices
• The minimal spectral radius of graphs with a given diameter
• Recent results in the theory of graph spectra
• Sparse topologies with small spectrum size
• Application of some graph invariants to the analysis of multiprocessor interconnection networks
• Parallel variable neighbourhood search algorithms for job shop scheduling problems
• Interconnection Networks and Their Eigenvalues

This page was built for publication: MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS